What better idea than a seminar on with Jack and other great speakers !

This special seminar of "Complexity and Combinatorial Optimization" will take place at Paris1 Panthéon-Sorbonne University, 17 place de la Sorbonne :

Amphitheater Richelieu on May 3 rd, 2019 from 2pm to 6pm.

For security reasons, we must provide to the security service the complete list of people registered. They will check each participant name with identity card.

Registration is free but necessary to access inside the Sorbonne.
Please register by sending an email to : sonia.vanier@univ-paris1.fr

Registrations will be closed on April 29.

More details on this event are aivalable on this program.

Speakers are :

Jack Edmonds ’NP ∩ coNP’.
https://fr.wikipedia.org/wiki/Jack_Edmonds

Laurence Wolsey "On Benders decomposition".
https://fr.wikipedia.org/wiki/Laurence_Wolsey

Bissan Ghaddar "A global optimization approach for binary polynomial programs"
https://www.ivey.uwo.ca/faculty/directory/bissan-ghaddar/

Abstract : In this talk, we present branch-and-dig, an algorithm to find global solutions for binary polynomial programming problems. Inequality generating techniques based on lift-and-project relaxations are developed to speed up the branch-and-bound process and reduce the number of nodes of the tree. Computational results for problems of degree two and degree three are provided to assess the the impact of the proposed approach.

Viet Hung Nguyen "Bender decomposition for control traffic lights".
http://www-ia.lip6.fr/~hnguyen/

We are looking forward welcoming you at the Sorbonne,