Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Ridha Mahjoub

Email : Ridha.Mahjoub@lamsade.dauphine.fr

Pole : Optimisation combinatoire algorithmique
Status : Professeur

  • Membre du CEVU
  • Membre du conseil scientifique
  • Distinction : Prix: Ouverture Internationale, Université Libre de Bruxelles, 2004. Prix du best student paper dans CIE 39, Troyes, juillet 2009 (papier avec mes étudiants). Prix du best student paper dans CIE 45, Metz, octobre 2015 (papier avec mes étudiants).

  • Encadrement de these de doctorat :


    • Mohamed Khalil Labidi : Parallélisation de métaheuristiques hybrides pour la résolution de POC ( Début : 2013-12-01)
    • Youcef Magnouche : Connexité de graphes : Structures minimales et formulations linéaires étendues ( Début : 2013-09-01)
    • Meriem Mahjoub : Conception et dimensionnement de réseaux fiables ( Début : 2013-12-01)
    • Yassine Naghmouchi : Modelisation de la securite de bout en bout ( Début : 2014-10-01)
    • Pedro Henrique Liguori : Approche polyhèdrale pour l optimisation des problèmes de conception de réseaux ( Début : 2015-10-01)
    voir toutes les theses

    Publications Dblp


    • Meriem Mahjoub, I. Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak
      The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut.Computers & Industrial Engineering112 2017:690-705

    • Hassene Aissi, Ali Ridha Mahjoub, R. Ravi
      Randomized Contractions for Multiobjective Minimum Cuts.ESA 2017:6:1-6:13

    • Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa
      Unsplittable non-additive capacitated network design using set functions polyhedra.Computers & OR66 2016:105-115

    • Luis Gouveia, Andrea Lodi 0001, Ali Ridha Mahjoub
      Preface.Discrete Optimization22 2016:1-5

    • Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak
      The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut.Electronic Notes in Discrete Mathematics52 2016:117-124

    • I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luís Gouveia, Pierre Pesneau
      Integer programming formulations for the -edge-connected 3-hop-constrained network design problem.Networks67(2) 2016:148-169

    • Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
      Two node-disjoint hop-constrained survivable network design and polyhedra.Networks67(4) 2016:316-337

    • M. Yassine Naghmouchi, Nancy Perrot, Nizar Kheir, Ali Ridha Mahjoub, Jean-Philippe Wary
      A New Risk Assessment Framework Using Graph Theory for Complex ICT Systems.MIST@CCS 2016:97-100

    • Mariem Ben Salem, Raouia Taktak, Hanêne Ben-Abdallah, Ali Ridha Mahjoub
      Polyhedral analysis for the disjunctively constrained Knapsack Problem.CoDIT 2016:557-562

    • Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
      The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.CoDIT 2016:683-688

    • Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub
      The k-node-connected subgraph problem: Facets and Branch-and-Cut.DRCN 2016:1-8

    • Mohamed Khalil Labidi, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Anissa Omrane
      A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem.GECCO 2016:685-692

    • Raffaele Cerulli, Satoru Fujishige, Ali Ridha Mahjoub
      Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected PapersISCO 2016:

    • Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger
      Preface.Math. Program.150(1) 2015:1-3

    • Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
      Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.Math. Program.154(1-2) 2015:3-28

    • Dominique de Werra, Nelson Maculan, Ali Ridha Mahjoub
      Preface.Discrete Applied Mathematics164 2014:1

    • Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
      Survivability in Hierarchical Telecommunications Networks Under Dual Homing.INFORMS Journal on Computing26(1) 2014:1-15

    • Nelson Maculan, Ali Ridha Mahjoub, Eduardo Uchoa
      Preface.RAIRO - Operations Research48(2) 2014:151-152

    • Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
      Mathematical formulations for the Balanced Vertex k-Separator Problem.CoDIT 2014:176-181

    • Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub
      On minimal two-edge-connected graphs.CoDIT 2014:251-256

    • Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder
      On the star forest polytope.CoDIT 2014:263-268

    • Boulbaba Thabti, Habib Youssef, Ali Ridha Mahjoub, Aref Meddeb
      Simulated evolution based algorithm versus exact method for virtual private network design.ICNC 2014:245-249

    • Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
      A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.IPCO 2014:25-36

    • Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos
      Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected PapersISCO 2014:

    • Ibrahima Diarrassouba, Ali Lourimi, Ali Ridha Mahjoub, Habib Youssef
      Hose workload based exact algorithm for the optimal design of virtual private networks.Computer Networks57(14) 2013:2766-2774

    • Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa
      Capacitated Network Design using Bin-Packing.Electronic Notes in Discrete Mathematics41 2013:479-486

    • Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak
      A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints.Electronic Notes in Discrete Mathematics41 2013:487-494

    • Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
      Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra.Electronic Notes in Discrete Mathematics41 2013:551-558

    • Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa
      Hop-level flow formulation for the survivable network design with hop constraints problem.Networks61(2) 2013:171-179

    • Pierre Fouilhoux, Ali Ridha Mahjoub
      Solving VLSI design and DNA sequencing problems using bipartization of graphs.Comp. Opt. and Appl.51(2) 2012:749-781

    • Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
      Models for the single-vehicle preemptive pickup and delivery problem.J. Comb. Optim.23(2) 2012:196-223

    • Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
      Survivability in hierarchical telecommunications networks.Networks59(1) 2012:37-58

    • Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau
      On the NP-completeness of the perfect matching free subgraph problem.Theor. Comput. Sci.423 2012:25-29

    • Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
      On the complexity of the Eulerian closed walk with precedence path constraints problem.Theor. Comput. Sci.439 2012:16-29

    • Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
      Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.ISCO 2012:117-128

    • Ali Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos
      Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected PapersISCO 2012:

    • Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
      Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.Computers & Industrial Engineering61(2) 2011:422-429

    • Boulbaba Thabti, Habib Youssef, Aref Meddeb, Ali Ridha Mahjoub
      Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models.ICNC 2011:2058-2064

    • Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot
      On the Design of Optical OFDM-Based Networks.INOC 2011:1-6

    • Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak
      Multilayer Survivable Optical Network Design.INOC 2011:170-175

    • Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa
      Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.INOC 2011:176-181

    • Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert
      The k edge-disjoint 3-hop-constrained paths polytope.Discrete Optimization7(4) 2010:222-233

    • Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
      On the complexity of the Eulerian closed walk with precedence path constraints problem.Electronic Notes in Discrete Mathematics36 2010:899-906

    • Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
      Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.Electronic Notes in Discrete Mathematics36 2010:1073-1080

    • Ali Ridha Mahjoub, S. Thomas McCormick
      Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.Math. Program.124(1-2) 2010:271-284

    • Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert
      A branch-and-cut algorithm for the -edge connected subgraph problem.Networks55(1) 2010:13-32

    • Imed Kacem, Ali Ridha Mahjoub
      Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval.Computers & Industrial Engineering56(4) 2009:1708-1712

    • Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman
      Generating Facets for the Independence System Polytope.SIAM J. Discrete Math.23(3) 2009:1484-1506

    • Mustapha Bouchakour, T. M. Contenza, Carl W. Lee, Ali Ridha Mahjoub
      On the dominating set polytope.Eur. J. Comb.29(3) 2008:652-661

    • Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
      On the Polytope of the (1, 2)-Survivable Network Design Problem.SIAM J. Discrete Math.22(4) 2008:1640-1666

    • David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau
      The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.Networks49(1) 2007:116-133

    • David Huygens, Ali Ridha Mahjoub
      Integer programming formulations for the two 4-hop-constrained paths problem.Networks49(2) 2007:135-144

    • Jean François Maurras, Ali Ridha Mahjoub
      Editorial.RAIRO - Operations Research41(3) 2007:231-233

    • Denis Cornaz, Ali Ridha Mahjoub
      The Maximum Induced Bipartite Subgraph Problem with Edge Weights.SIAM J. Discrete Math.21(3) 2007:662-675

    • Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub
      Design of survivable IP-over-optical networks.Annals OR146(1) 2006:41-73

    • Pierre Fouilhoux, Ali Ridha Mahjoub
      Polyhedral results for the bipartite induced subgraph problem.Discrete Applied Mathematics154(15) 2006:2128-2149

    • Ali Ridha Mahjoub, Jean Mailfert
      On the independent dominating set polytope.Eur. J. Comb.27(4) 2006:601-616

    • Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau
      Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.Math. Program.105(1) 2006:85-111

    • Jean Fonlupt, Ali Ridha Mahjoub
      Critical extreme points of the 2-edge connected spanning subgraph polytope.Math. Program.105(2-3) 2006:289-310

    • Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
      On the edge-disjoint 2-hop-constrained paths polytope.Oper. Res. Lett.34(5) 2006:577-582

    • Hervé Kerivin, Ali Ridha Mahjoub
      On survivable network polyhedra.Discrete Mathematics290(2/3) 2005:183-210

    • Hervé Kerivin, Ali Ridha Mahjoub
      Design of Survivable Networks: A survey.Networks46(1) 2005:1-21

    • David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
      Two Edge-Disjoint Hop-Constrained Paths and Polyhedra.SIAM J. Discrete Math.18(2) 2004:287-312

    • Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert
      Composition of Graphs and the Triangle-Free Subgraph Polytope.J. Comb. Optim.6(4) 2002:359-381

    • Hervé Kerivin, Ali Ridha Mahjoub
      Separation of partition inequalities for the (1, 2)-survivable network design problem.Oper. Res. Lett.30(4) 2002:265-268

    • Mourad Baïou, Ali Ridha Mahjoub
      The Steiner Traveling Salesman Polytope and Related Polyhedra.SIAM Journal on Optimization13(2) 2002:498-507

    • Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
      Steiner trees and polyhedra.Discrete Applied Mathematics112(1-3) 2001:101-120

    • Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert
      Composition of graphs and the triangle free subgraph polytope.Electronic Notes in Discrete Mathematics5 2000:19-22

    • Ali Ridha Mahjoub, Pierre Pesneau
      On Steiner 2-edge connected polytopes.Electronic Notes in Discrete Mathematics5 2000:210-213

    • Mohamed Didi Biha, Ali Ridha Mahjoub
      Steiner k-Edge Connected Subgraph Polyhedra.J. Comb. Optim.4(1) 2000:131-144

    • Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
      Separation of Partition Inequalities.Math. Oper. Res.25(2) 2000:243-254

    • Ali Ridha Mahjoub, Charles Nocq
      On the Linear Relaxation of the 2-node Connected Subgraph Polytope.Discrete Applied Mathematics95(1-3) 1999:389-416

    • Jean Fonlupt, Ali Ridha Mahjoub
      Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.IPCO 1999:166-182

    • Mustapha Bouchakour, Ali Ridha Mahjoub
      One-node cutsets and the dominating set polytope.Discrete Mathematics165-166 1997:101-123

    • Ali Ridha Mahjoub
      On perfectly two-edge connected graphs.Discrete Mathematics170(1-3) 1997:153-172

    • Mourad Baïou, Ali Ridha Mahjoub
      Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.SIAM J. Discrete Math.10(3) 1997:505-514

    • Ali Ridha Mahjoub
      A Min-max Relation for K-covers in Graphs Noncontractible to Ke.Discrete Applied Mathematics62(1-3) 1995:209-219

    • Francisco Barahona, Ali Ridha Mahjoub
      On two-connected subgraph polytopes.Discrete Mathematics147(1-3) 1995:19-34

    • Ali Ridha Mahjoub
      Two-edge connected spanning subgraphs and polyhedra.Math. Program.64 1994:199-208

    • Francisco Barahona, Ali Ridha Mahjoub
      Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.SIAM J. Discrete Math.7(3) 1994:344-358

    • Francisco Barahona, Ali Ridha Mahjoub
      Compositions of Graphs and Polyhedra II: Stable Sets.SIAM J. Discrete Math.7(3) 1994:359-371

    • Francisco Barahona, Ali Ridha Mahjoub
      Compositions of Graphs and Polyhedra III: Graphs with No W Minor.SIAM J. Discrete Math.7(3) 1994:372-389

    • Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub
      Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.SIAM J. Discrete Math.7(3) 1994:390-402

    • Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry
      Compositions in the bipartite subgraph polytope.Discrete Mathematics105(1-3) 1992:73-91

    • Francisco Barahona, Ali Ridha Mahjoub
      On 2-Connected Subgraph Polytopes.IPCO 1992:30-43

    • Reinhardt Euler, Ali Ridha Mahjoub
      On a composition of independence systems by circuit identification.J. Comb. Theory, Ser. B53(2) 1991:235-259

    • Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub
      A note on -perfect graphs.Journal of Graph Theory14(3) 1990:333-340

    • Francisco Barahona, Ali Ridha Mahjoub
      Facets of the balanced (acyclic) induced subgraph polytope.Math. Program.45(1-3) 1989:21-33

    • Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix
      Book reviews.ZOR - Meth. & Mod. of OR32(5) 1988:346-351

    • Ali Ridha Mahjoub
      On the stable set polytope of a series-parallel graph.Math. Program.40(1-3) 1988:53-57

    • Michele Conforti, Derek Gordon Corneil, Ali Ridha Mahjoub
      -covers. II. -perfect graphs.Journal of Graph Theory11(4) 1987:569-584

    • Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub
      K-covers I: Complexity and polytopes.Discrete Mathematics58(2) 1986:121-142

    • Francisco Barahona, Ali Ridha Mahjoub
      On the cut polytope.Math. Program.36(2) 1986:157-173

    • Ali Ridha Mahjoub
      Étude de structures combinatoires issues de la physique statistique et d'autres domaines. (Analysis of combinatorial structures issued from statistical physics and other domains). 1985:

    • Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub
      Facets of the Bipartite Subgraph Polytope.Math. Oper. Res.10(2) 1985:340-358

    • Ali Ridha Mahjoub
      I. Résolution d'un problème de régulation de trafic II. Polytope des absorbants d'un graphe à seuil. (I. Resolving a traffic-control problem II. The polytope of the absorbers of a threshold graph). 1981:



    Publications DFIS


    Publications HAL