Séminaire Léo Liberti

Vendredi 05 Février 2010 (14h00)

Léo Liberti, Laboratoire d'Informatique d'X (LIX), Ecole Polytechnique, 91128 Palaiseau, France.

Titre : Reformulations in mathematical programming : Symmetry.

Résumé : If a mathematical program has many symmetric optima, solving it via Branch-and-Bound often yields search trees of large sizes; thus, finding and exploiting symmetries is an important task. We propose a method for finding the formulation group of any MINLP and a reformulation for reducing symmetries. The reformulated problem can then be solved via solvers such as CPLEX or Couenne. We present detailed computational results and a study of the Kissing Number Problem's symmetries.