FR
Professeur A. Ridha Mahjoub
Supervision
(Former) Ph.D. Students
-
Mourad
Baïou, Director of Researcher, CNRS (National Scientific Research Center of France), "The Steiner 2-edge connected subgraph problem: Polyhedral Approch", defended in
December 1996.
Mourad
Baïou won in 2003 the Robert Faure price offered by ROADEF (the French Operations Research Society) for young researchers. .
-
M. Bouchakour, Senior Consultant at ALTRAN, Information Systems, Paris,
"I. Compositions in the dominating subgraph polytope.
II. A cutting plane algorithm for the fixed charge network flow problem.", defended in
December 1996.
-
M. Didi
Biha, Full Professor, Université de Caen, Caen, France,
"k-edge connected graphs and polyhedra", defended in September 1998
).
-
Hervé
Kerivin, Assistant Professor, Université de Clermont, Clermont-Ferrand, France, "Survivable Networks and polyhedra", defended in November 2000.
Hervé
H. Kerivin won in 2006 the Robert Faure price offered by Roadef (the French Operations Research Society) for young researchers..
-
Pierre
Pesneau, Assistant Professor, Université de Bordeaux, France,
"k-Partite graphs and applications to VLSI circuits", defended in
November 2003 .
-
Pierre
Fouilhoux,Full Professor, LIPN, Paris, France. "Graphes
k-partis et conceptions de
circuits
VLSI", defended in December 2004.
P. Fouilhoux won in 2006 the young researcher price of the city of Clermont-Ferrand.
-
David
Huygens , Senior Consultant at OM Partners, Brussels, Belgium,
"Design of Survivable Networks with Bounded-Length Paths",
defended in September 2005 (Co-supervised by M.
Labbé, GOM, Université Libre de Bruxelles).
-
Sylvie
Borne, Assistant Professor, Université Paris 13, Paris, France,
"Survivability and routing in telecommunication networks",
(With France Telecom),
defended in December 2006.
.
- Lise
Slama, Consultant at BBS, Clermont-Ferrand, France, "Design of Survivable networks: Separation and Polyhedra ", defended the
26 of November 2008.
- Ibrahima
Diarrassouba, Assistant Professor, Université du Havre, France, "Survivable Network DesignProblems with High Connectivity Requirements",(Problèmes
de Conception de Réseaux avec Forte Connexité), (Co-supervised by M.
F. Bendali, J.
Mailfert and
M. Didi Biha),
defended the 7 of December 2009.
- Mathieu
Lacroix, Assistant Professor, Université Paris 13, Paris, France, "The preemptive pickup and delivery problem: complexity, models and polyhedrat", defended the 7
December 2009, (Co-supervised by A. Quilliot et H.
Kérivin).
- Onur
Ozkök, Senior Consultant at Applied Materials, USA, "Hub and Regenerator Lacation and Survivable Network Design", defended in December 2010, (co-supervised by O. Ekin Karasan and H. Yaman of Bilkent University, December 2010 at Bilkent University, Ankara)
- Sébastien Martin, Researcher in Huawei"Structural Analysis of Algebraic-Differential Systems: Complexity, Models and Polyhedra",
defended the 7 of December 2011, (prepared within the project ANR PARADE in collaboration with the companies SIEMENS (Toulouse, France) and LMS-IMAGINE (Roanne, France)).
- Raouia Taktak, Assistant Professor, Université de Sfax, Sfax, Tunisia, "Survivability in
Multilayer Networks : Models and Polyhedra",
defended the 4 of July 2013.
- Amal Benhamiche, Researcher in Orange-Lab (France-Telecom), Paris, France, "Designing
optical multi-band networks: polyhedral analysis and algorithms",
defended the 12 December 2013.
- Mohamed Ould Mohamed Lemine ,General Director, ADIAS, Paris, France,
"Inter-company knowledge and Combinatorial Optimization",
defended the 17 of June 2014 (With ALTARES, Paris).
- Mariem Ben Salem , Assistant Professor, Université de Sousse, Sousse, Tunisia,
"Exact and heuristic optimization methods for variants of the knapsack problem",
defended in 2015-2016, (Université de SFAX).
- Youcef Magnouche , Researcher in Huawei "The multi-terminal vertex
separator problem : Complexity, Polyhedra and Algorithms",
defended the 26 of June 2017.
- Meriem Mahjoub , Consultant, Paris, France, "The Survivable Network Design
Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms",
defended the 13 December 2017, (With Université Al-Manar, Tunis,
Tunisie).
- Mohamed Khalil Labidi , Consultant, Paris, France. "Parallelisation of hybrid
metaheuristics for COP solving",
defended the 20 of September 2018, (With Université Al-Manar, Tunis,
Tunisie).
- M. Yassine Naghmouchi, "Security Management in Complex Systems: Models, Polyhedra and Algorithms ",
defended the 17 of June 2019,
(Co-supervised by N. Perrot).
- Youssouf Hadhbi, Researcher in Orange,"The Constrained-Routing and Spectrum Assignment Problem: Polyhedral Analysis and Algorithms ".
- Isma Bentoumi, Researcher in Dassault, "The multicommodity flow blocker problem:
Polyhedral analysis and algorithms ",
defended the 8 of July 2024,
(Cette thèse a été préparée dans le cadre d'un contrat avec Huawei).
- Charles Nourry, Consultant in Artelys, Paris, France "The Budgeted Spanning Tree Problem: Extended formulations, Projection, and Branch-and-Cut ",
defended the 11 of June 2025.