Research
My research is about mathematical programming, heuristics and graphs. I've worked on cutting and packing problems, flight scheduling, planification, yield management, and staff scheduling.
My focus is now on methods for managing very large models based on extended formulations.
Former PhD students
- Ali Khanafer (2007-2010) - packing problems with conflicts
- Nadia Dahmani (2009-2014) - multi-dimensional packing problems
- Matthieu Gérard (2012-2015) - staff scheduling
- Jérémy Guillot (2013-2018) - clustering problems
- Quentin Viaud (2014-2018) - 2D packing problems
- Gaël Guillot (2017-2020) - Aggregation-disaggregation techniques in dynamic programming algorithms
- Mohamed Benkirane - Optimization of train operations
- Xavier Blanchot (2018-2022) - Benders decomposition and bilevel optimization
- Parfait Ametana (2021-2025)- Robust network design problems
Current PhD students
- Cécile Dupouy - Logistics and physical internet
- Luis Marques - Aggregation-disaggregation techniques in integer linear programming algorithms
- Fulin Yan - Machine learning and optimization
- Pierre Pinet - Vehicle routing problems
- Lionel Rolland - Hydro-valley optimization (Cifre EDF)
- Arthur Léonard - Vehicle routing problem (ENS)
Prices
- 2012 - Prix Robert Faure: Premier accessit
- 2006 - Prix de thèse "Guy Deniélou"
Challenge ROADEF 2009
Ranked second for the ROADEF Challenge 2009 (disruption management for commercial aviation) with Saïd Hanafi, Christophe Wilbaut et Raïd Mansi (Université de Valenciennes).
Challenge website