PhD Supervisions
Guilluame Beraud Sudreau (2024-)
Title: Network optimization with non-linear performance models.
Co-supervised: Hervé KERIVIN (33%), Walid Ben Ameur (33%), Sébastien Martin (33%)
Isma Bentoumi (2019-2024)
Title: Optimization method for the multi-commodity flow blocker problem.
Co-supervised: Fabio Furini (33%), Ridha Mahjoub (33%), Sébastien Martin (33%)
Sarah Minich (2017-2022)
Title: Approximation algorithms for solving some pagination problems.
Co-supervised: Imed Kacem (33%), Aristide Grange (33%), Sébastien Martin (33%)
Youcef Magnouche (2013-2017)
Title: The multi-terminal vertex separator problem: Complexity, Polyhedra and Algorithms.
Co-supervised: Denis Cornaz (10%), Ridha Mahjoub (40%), Sébastien Martin (50%)
Mohammed Albarra Hassan Abdeljabbar Hassan (2013-2016)
Title: Robust scheduling problem for cloud computing
Co-supervised: Imed Kacem(50%), Sébastien Martin (50%)
Mohamed Ould (2011-2014)
Title: Combinatorial optimization and knowledge on companies
Co-supervised: Ridha Mahjoub (50%), Sébastien Martin (50%)
Master Student supervisions
Full or partial supervision.
Abdellah Bulaich Mehamdi (2023)
Pricing (De)-activation: Multicommodity Flow and Column Generation
Walid Astaoui (2022)
On the k-spanning tree problem variants: Complexity and algorithms
Jiachen Zhang (2022)
The Multi-Commodity Flow Problem with disjoint paths
Miguel Pineda Martin (2022)
Quantum computing and combinatorial optimization approach for solving Unsplittable Multi-commodity Flow Problem
Corentin Clavier (2021)
OSPF decomposition area and combinatorial optimization
Corentin Juvigny (2020)
On the shortest path problem with node inclusion
Alexandre Schulz (2019)
Machine learning applied to shortest-path problems
Mathieu Kintzinger (2015)
Robust nurse assignment problem with priority
Karine Laurent (2015)
On the knapsack problem with overlapping object
Xin Wang (2015)
Heuristic and meta-heuristic for the k-separator problem
Zheng Mengli (2014)
Column generation algorithm for the robust nurse assignment problem
Xiaotong Jiao(2013)
Uni-dimensional cutting problem
Ali Taleb(2012)
A branch-and-bound algorithm for a scheduling problem