Reformulations based algorithms for Combinatorial Optimization
Reformulations based algorithms for Combinatorial Optimization

Our aim is to develop tight formulations for combinatorial problems by combining the latest reformulation techniques, such as Lagrangian and polyhedral approach, non-linear programming tools and graph theoretics tools. Through industrial partnerships, the team targets large scale problems such as those arising in logistics (routing problems), in planning and scheduling, in network design and control, and in placement problems (cutting stock problems).

Centre(s) inria
In partnership with
CNRS,Université de Bordeaux


Clautiaux François

Alves Pessoa Artur

Arslan Ayse Nur

Balster Isaac

Ben Mohamed Imen

Blanchot Xavier

Depouilly Philippe

Detienne Boris

Facq Laurent

Froger Aurelien

Guillot Gael

Joncour Cédric

Kechir Mellila

Khachai Daniiil

Klibi Walid

Leveque Johan

Meurdesoif Philippe

Pêcher Arnaud

Pesneau Pierre

Rivera Letelier Orlando

Sadykov Ruslan

Stauffer Gautier