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


    Publications DFIS


    Publications HAL


    29 DISTANCE TRANSFORMATION FOR NETWORK DESIGN PROBLEMS (, , and ), . [bibtex] [pdf]

    28 Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem (, , , and ), In Networks, Wiley, volume 67, . [bibtex] [pdf] [doi]

    27 On minimal two-edge-connected graphs (, and ), In 2014 International Conference on Control, Decision and Information Technologies (CoDIT), . [bibtex] [pdf] [doi]

    26 Mathematical Formulations for the Balanced Vertex k-Separator Problem (, , , , and ), In 2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT) (Kacem, I, Laroche, P, Roka, Z, eds.), . [bibtex] [pdf]

    25 Mathematical formulations for the Balanced Vertex k-Separator Problem (, , , , and ), In International Conference on Control, Decision and Information Technologies (CoDIT), . [bibtex] [pdf] [doi]

    24 A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (, , and ), In Integer Programming and Combinatorial Optimization 17th International Conference, IPCO 2014, . [bibtex] [pdf] [doi]

    23 Polyhedral Approaches (), Chapter in Concepts of Combinatorial Optimization, . [bibtex] [pdf] [doi]

    22 Survivability in Hierarchical Telecommunications Networks Under Dual Homing (, , and ), In INFORMS Journal on Computing, volume 26, . [bibtex] [pdf] [doi]

    21 Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra (, and ), . [bibtex] [pdf]

    20 Capacitated Network Design using Bin-Packing (, and ), In Electronic Notes in Discrete Mathematics, volume 41, . [bibtex] [pdf] [doi]

    19 Hop-level flow formulation for the survivable network design with hop constraints problem (, and ), In Networks, volume 61, . [bibtex] [pdf] [doi]

    18 Hose Workload based Exact Algorithm for the Optimal Design of Virtual Private Networks (, , and ), In Computer Networks, volume 57, . [bibtex] [pdf] [doi]

    17 A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints (, and ), In Electronic Notes in Discrete Mathematics, volume 41, . [bibtex] [pdf] [doi]

    16 From constant traffic matrices to hose workload model for VPN tree design (, , , and ), In XVth International Symposium on Telecommunications Network Strategy and Planning (NETWORKS), 2012, . [bibtex] [pdf] [doi]

    15 Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem (, and ), In Second International Symposium on Combinatorial Optimization, ISCO 2012, . [bibtex] [pdf] [doi]

    14 Combinatorial Optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers (, , and ), Springer, . [bibtex] [pdf]

    13 On the NP-completeness of the perfect matching free subgraph problem (, , and ), In Theoretical Computer Science, volume 423, . [bibtex] [pdf] [doi]

    12 On the NP-Completeness of the Perfect Matching Free Subgraph Problem (, , and ), In Theoretical Computer Science, Elsevier, volume 423, . [bibtex] [pdf]

    11 On the complexity of the Eulerian closed walk with precedence path constraints problem (, and ), In Theoretical Computer Science, volume 439, . [bibtex] [pdf] [doi]

    10 Models for the single-vehicle preemptive pickup and delivery problem (, and ), In Journal of Combinatorial Optimization, volume 23, . [bibtex] [pdf] [doi]

    9 On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem (, , and ), . [bibtex] [pdf]

    8 Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem (, and ), In INOC 2011, . [bibtex] [pdf] [doi]

    7 The Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut (, , and ), . [bibtex] [pdf]

    6 The maximum cut problem (, and ), Chapter in Paradigms of combinatorial optimization : problems and new approaches, volume 2, Iste; Wiley, . [bibtex] [pdf] [doi]

    5 A branch-and-cut algorithm for the k-edge connected subgraph problem (, , , and ), In Networks, Wiley, volume 55, . [bibtex] [pdf] [doi]

    4 On the Steiner 2-edge connected subgraph polytope ( and ), In RAIRO - Operations Research, EDP Sciences, volume 42, . [bibtex] [pdf] [doi]

    3 On the k edge-disjoint 2-hop-constrained paths polytope (, , and ), In Operations Research Letters, Elsevier, volume 34, . [bibtex] [pdf] [doi]

    2 Two edge-disjoint hop-constrained paths and polyhedra (, and ), In Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, volume 18, . [bibtex] [pdf] [doi]

    1 Analysis of combinatorial structures issued from statistical physics and other domains (), PhD thesis, Université Joseph-Fourier - Grenoble I, . [bibtex] [pdf]