11 lamsade dauphine fr english software htm

We shall review some methods to handle them that can be understood as stabilization techniques. Sa formulation la plus naturelle utilise un nombre exponentiel de variables.

This problem when restricted to a single arc reduces to the bin packing problem. We focus on this restriction and propose a new "aggregated" formulation in order to overcome the symmetries of the bin packing problem and study the polyhedron of its solutions. We then introduce two classes of facet-defining valid inequalities and embed them whithin a Branch-and-Cut algorithm the solve efficiently the UNACND problem.

Finally, we show some numerical experiments for SNDlib based instances. Aller au contenu principal. Find out about the latest seminars.

Open Science, Bingo! Message from the director The centre is organised along two main lines: one concerning scientific animation the groups, or "poles" and one concerning research itself the projects. Daniela Grigori, Director. Seminars Combinatorial O Efficient Online Learning for Dynamic k Combinatorial O Minimum Stable Cut and Treewidth 11 October Seminars All seminaries.

The slides of my defense are available here. My thesis manuscript is available here. Key-words : Graphs, combinatorial optimisation, parameterized complexity, approximation, algorithmics, machine learning. I am currently postdoctoral researcher at Paris-Dauphine University on solving graph problems with machine learning tools, under the supervision of professor Tristan Cazenave , Florian Yger and Florian Sikora. My thesis deals with community detection on graphs, from the complexity and algorithmic point of view.

I also taught at Epita and directed tutorials at Paris-Dauphine University from to Python, VBA, Caml.