Jeudi 11 Mars
Heure: 
10:30  11:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Learning to solve the single machine scheduling problem with release times and sum of completion times 
Description: 
Axel Parmentier In this work, we focus on the solution of a hard single machine scheduling problem by new heuristic algorithms embedding techniques from machine learning field and scheduling theory. These heuristics transform an instance of the hard problem into an instance of a simpler one solved to optimality. The obtained schedule is then transposed to the original problem. Computational experiments show that they are competitive with stateoftheart heuristics, notably on large instances. 
Mercredi 17 Mars
Heure: 
15:00  16:00 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
A snapshot of quantum algorithms for optimization 
Description: 
Giacomo Nannicini There is much hype surrounding quantum computing and its potential applications for optimization. However, the technical details are often lost in translation. In this talk I will give an overview of quantum algorithms that may  one day  be useful for continuous and discrete optimization, highlighting possible sources of advantage as well as limitations. In particular, I will discuss variational hybrid algorithms for optimization, simulated annealing for counting problems, algorithms for linear systems, and algorithms for SDPs and LPs. I assume no prior knowledge of quantum mechanics. 

