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


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

    49 Preface (, and ), In Mathematical Programming, volume 150, . [bibtex] [doi]

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

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

    46 On the star forest polytope (, , and ), In 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE, . [bibtex]

    45 Polyhedral Approaches (), Chapter in (Vangelis Th. Paschos, ed.), John Wiley & Sons, Inc., . [bibtex]

    44 A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (, , and ), In Integer Programming and Combinatorial Optimization 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings (Jon Lee, Jens Vygen, ed.), Springer, . [bibtex]

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

    42 Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra (, and ), In Electronic Notes in Discrete Mathematics, volume 41, . [bibtex] [doi]

    41 Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra (, and ), In Electronic Notes in Discrete Mathematics, volume 41, . [bibtex] [doi]

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

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

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

    37 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 - proceedings, IEEE, . [bibtex]

    36 Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem (, and ), In Network Optimization (Voß, Stefan, ed.), Springer, . [bibtex]

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

    34 Survivability in hierarchical telecommunications networks (, , , and ), In Networks, volume 59, . [bibtex] [doi]

    33 Solving VLSI design and DNA sequencing problems using bipartization of graphs ( and ), In Computational Optimization and Applications, volume 51, . [bibtex] [doi]

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

    31 Editorial (, and ), In International Journal of Mathematics in Operational Research, volume 4, . [bibtex]

    30 Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem (, and ), In Combinatorial Optimization. Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers (A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos, ed.), Springer, . [bibtex]

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

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

    27 On the NP-Completeness of the Perfect Matching Free Subgraph Problem (, , and ), Technical report, Cahiers du Lamsade, . [bibtex]

    26 On the Design of Optical OFDM-Based Networks (, and ), In Network Optimization 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011, Proceedings (Voss, Stefan, ed.), Springer, . [bibtex]

    25 Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models (, , and ), In Proceedings of the 7th International Conference on Natural Computation, IEEE, . [bibtex]

    24 Progress in combinatorial optimization (), ISTE - WILEY, . [bibtex]

    23 Multilayer Survivable Optical Network Design (, , and ), In Network Optimization 5th International Conference, INOC 2011 (Voß, Stefan, ed.), Springer, . [bibtex]

    22 Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. (, and ), In Computers & Industrial Engineering, volume 61, . [bibtex] [doi]

    21 Partition Inequalities: Separation, Extensions and Network Design, (, and ), Chapter in (Mahjoub, Ali Ridha, ed.), ISTE - WILEY, . [bibtex]

    20 Design of optical WDM networks (, and ), In 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 - proceedings, IEEE, . [bibtex]

    19 Separation Algorithms for Single-Machine Scheduling with Precedence Constraints ( and ), . [bibtex]

    18 Structural Analysis for Differential-Algebraic Systems : Complexity, formulation and facets (, and ), In ISCO International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, . [bibtex]

    17 On the complexity of the Eulerian closed walk with precedence path constraints problem (, and ), In ISCO International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, . [bibtex]

    16 Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation ( and ), In Mathematical Programming, volume 124, . [bibtex] [doi]

    15 Le problème de conception de réseau fiable avec contrainte de borne (, and ), . [bibtex]

    14 Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem (, and ), . [bibtex]

    13 A Branch-and-Cut algorithm for the k-edge connected subgraph problem (, , , and ), In Networks, volume 55, . [bibtex] [doi]

    12 Le problème de sécurisation multicouche du réseau optique (, and ), . [bibtex]

    11 Design of Multilayer Survivable Optical Networks (, and ), . [bibtex]

    10 Design of Multilayer Survivable Optical Networks (, , and ), . [bibtex]

    9 The k edge-disjoint 3-hop-constrained paths polytope (, , and ), In Discrete Optimization, volume 7, . [bibtex] [doi]

    8 Survivability in hierarchical telecommunications networks (, , , and ), . [bibtex]

    7 Optimiser sur les ensembles d'arêtes des graphes bipartis induits ( and ), In ROADEF 2009, extended abstracts, livre des résumés (Laboratoire lorrain de recherche en informatique et ses applications, ed.), LORIA, . [bibtex]

    6 Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization (, and ), In Computers and Industrial Engineering. International Conference. 2009. (CIE39) (Kacem, Imed, ed.), IEEE, . [bibtex]

    5 Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval ( and ), In Computers & Industrial Engineering, volume 56, . [bibtex] [doi]

    4 The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut (, , and ), . [bibtex]

    3 Generating Facets for the Independence System Polytope (, , and ), In SIAM Journal on Discrete Mathematics, volume 23, . [bibtex] [doi]

    2 Steiner k-edge connected subgraph polyhedra ( and ), In Journal of Combinatorial Optimization, volume 4, . [bibtex] [doi]

    1 Separating Partition Inequalities (, and ), In Mathematics of Operations Research, volume 25, . [bibtex] [doi]

    Publications HAL