Mahjoub Ali Ridha - CV

Articles

Kacem I., Kellerer H., Mahjoub A. (2021), Preface: New trends on combinatorial optimization for network and logistical applications, Annals of Operations Research, vol. 298, p. 1-5

Magnouche Y., Mahjoub A., Martin S. (2021), The multi-terminal vertex separator problem: Branch-and-Cut-and-Price, Discrete Applied Mathematics, vol. 290, p. 86-111

Benhamiche A., Mahjoub A., Perrot N., Uchoa E. (2020), Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut, Discrete Optimization, vol. 35, p. 100555

Gabrel V., Mahjoub A., Taktak R., Uchoa E. (2020), The Multiple Steiner TSP with order constraints: complexity and optimization algorithms, Soft Computing

Mahjoub A., Poss M., Simonetti L., Uchoa E. (2019), Distance transformation for network design problems, SIAM Journal on Optimization, vol. 29, n°2, p. 1687-1713

Cornaz D., Magnouche Y., Mahjoub A., Martin S. (2019), The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut, Discrete Applied Mathematics, vol. 256, n°1, p. 11-37

Cornaz D., Furini F., Lacroix M., Malaguti E., Mahjoub A., Martin S. (2019), The vertex k-cut problem, Discrete Optimization, vol. 31, n°1, p. 8-28

Diarrassouba I., Labidi M., Mahjoub A. (2019), A parallel hybrid optimization algorithm for some network design problems, Soft Computing, vol. 23, n°6, p. 1947-1964

Fujishige S., Mahjoub A., Rendl F. (2019), Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016, Journal of Combinatorial Optimization, vol. 37, n°1, p. 418-422

Arslan O., Karaşan O., Mahjoub A., Yaman H. (2019), A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing, Transportation Science, vol. 53, n°4, p. 1107-1125

Ben Salem M., Taktak R., Mahjoub A., Ben-Abdallah H. (2018), Optimization algorithms for the disjunctively constrained knapsack problem, Soft Computing, vol. 22, n°6, p. 2025-2043

Mahjoub A., Naghmouchi M., Perrot N. (2018), A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems, Electronic Notes in Discrete Mathematics, vol. 64, p. 295-304

Cornaz D., Kerivin H., Mahjoub A. (2018), Minimal arc-sets spanning dicycles, Discrete Applied Mathematics, vol. 240, n°1, p. 33-43

Kheir N., Mahjoub A., Naghmouchi M., Perrot N., Wary J-P. (2018), Assessing the risk of complex ICT systems, Annales des télécommunications / Annals of telecommunications, vol. 73, n°1-2, p. 95-109

Borne S., Gourdin E., Klopfenstein O., Mahjoub A. (2018), A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem, Computers & Industrial Engineering, vol. 124, p. 582-603

Diarrassouba I., Gabrel V., Mahjoub A., Gouveia L., Pesneau P. (2016), Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem, Networks, vol. 67, n°2, p. 148-169

Woeginger G., Mahjoub A., Rinaldi G. (2015), Preface, Mathematical Programming, vol. 150, n°1, p. 1-3

Karaşan O., Mahjoub A., Özkök O., Yaman H. (2014), Survivability in Hierarchical Telecommunications Networks Under Dual Homing, INFORMS Journal on Computing, vol. 26, n°1, p. 1-15

Borne S., Mahjoub A., Taktak R. (2013), A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints, Electronic Notes in Discrete Mathematics, vol. 41, p. 487–494

Uchoa E., Mahjoub A., Simonetti L. (2013), Hop-level flow formulation for the survivable network design with hop constraints problem, Networks, vol. 61, n°2, p. 171-179

Benhamiche A., Mahjoub A., Uchoa E. (2013), Capacitated Network Design using Bin-Packing, Electronic Notes in Discrete Mathematics, vol. 41, p. 479-486

Diarassouba I., Youssef H., Mahjoub A., Lourimi A. (2013), Hose Workload based Exact Algorithm for the Optimal Design of Virtual Private Networks, Computer Networks, vol. 57, n°14, p. 2766-2774

Kutucu H., Diarrassouba I., Mahjoub A. (2013), Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra, Electronic Notes in Discrete Mathematics, vol. 41, p. 551-558

Kutucu H., Diarrassoubaa I., Mahjoub A. (2013), Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra, Electronic Notes in Discrete Mathematics, vol. 41, p. 551-558

Mahjoub A., Lacroix M., Kerivin H. (2012), On the complexity of the Eulerian closed walk with precedence path constraints problem, Theoretical Computer Science, vol. 439, p. 16-29

Mahjoub A., Fouilhoux P. (2012), Solving VLSI design and DNA sequencing problems using bipartization of graphs, Computational Optimization and Applications, vol. 51, n°2, p. 749-781

Lacroix M., Kerivin H., Mahjoub A. (2012), Models for the single-vehicle preemptive pickup and delivery problem, Journal of Combinatorial Optimization, vol. 23, n°2, p. 196-223

Lacroix M., Mahjoub A., Martin S., Picouleau C. (2012), On the NP-completeness of the perfect matching free subgraph problem, Theoretical Computer Science, vol. 423, p. 25-29

Mahjoub A., Kacem I., Hifi M. (2012), Editorial, International Journal of Mathematics in Operational Research, vol. 4, n°3, p. 211-213

Ozkök O., Mahjoub A., Yaman H., Ekin-Karasan O., Fouilhoux P. (2012), Survivability in hierarchical telecommunications networks, Networks, vol. 59, n°1, p. 37-58

Lacroix M., Martin S., Mahjoub A. (2011), Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems., Computers & Industrial Engineering, vol. 61, n°2, p. 422-429

Ibrahima D., Didi Biha M., Bendali F., Mahjoub A., Mailfert J. (2010), A Branch-and-Cut algorithm for the k-edge connected subgraph problem, Networks, vol. 55, n°1, p. 13-32

Mahjoub A., McCormick T. (2010), Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation, Mathematical Programming, vol. 124, n°1-2, p. 271-284

Bendali F., Mahjoub A., Diarrassouba I., Mailfert J. (2010), The k edge-disjoint 3-hop-constrained paths polytope, Discrete Optimization, vol. 7, n°4, p. 222-233

Kacem I., Mahjoub A. (2009), Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering, vol. 56, n°4, p. 1708-1712

Fouilhoux P., Mahjoub A., Labbé M., Yaman H. (2009), Generating Facets for the Independence System Polytope, SIAM Journal on Discrete Mathematics, vol. 23, n°3, p. 1484-1506

Quilliot A., Mahjoub A., Lacroix M., Kerivin H. (2008), The splittable pickup and delivery problem with reloads, European Journal of Industrial Engineering, vol. 2, n°2, p. 112-133

Contenza T., Mahjoub A., Bouchakour M., Lee C. (2008), On the dominating set polytope, European Journal of Combinatorics, vol. 29, n°3, p. 652-661

Pesneau P., Mahjoub A. (2008), On the Steiner 2-edge connected subgraph polytope, RAIRO - Operations Research, vol. 42, n°3, p. 259-283

Mahjoub A., Kerivin H., Didi Biha M. (2008), On the Polytope of the (1,2)-Survivable Network Design Problem, SIAM Journal on Discrete Mathematics, vol. 22, n°4, p. 1640- 1666

Mahjoub A., Cornaz D. (2007), The maximum induced bipartite subgraph problem with edge weights, SIAM Journal on Discrete Mathematics, vol. 21, n°3, p. 662-675

Labbé M., Mahjoub A., Pesneau P., Huygens D. (2007), The Two-Edge Connected Hop-Constrained Network Design Problem : Valid Inequalities and Branch-and-Cut, Networks, vol. 49, n°1, p. 116-133

Fouilhoux P., Mahjoub A. (2006), Polyhedral results for the bipartite induced subgraph problem, Discrete Applied Mathematics, vol. 154, n°15, p. 2128-2149

Mahjoub A., Mailfert J. (2006), On the independent dominating set polytope, European Journal of Combinatorics, vol. 27, n°4, p. 601-616

Huygens D., Mahjoub A. (2006), Integer programming formulations for the two 4-hop-constrained paths problem, Networks, vol. 49, n°2, p. 135-144

Huygens D., Pesneau P., Dahl G., Mahjoub A. (2006), On the k edge-disjoint 2-hop-constrained paths polytope, Operations Research Letters, vol. 34, n°5, p. 577-582

Mahjoub A., McCormick T., Fortz b., Pesneau P. (2006), Two-edge connected subgraph with bounded rings problem: Polyhedral results and Branch-and-Cut, Mathematical Programming, vol. 105, n°1, p. 85-111

Mahjoub A., Fonlupt J. (2006), Critical extreme points of the 2-edge connected subgraph polytope, Mathematical Programming, vol. 105, n°2-3, p. 289-310

Kerivin H., Mahjoub A. (2005), On Survivable Network Polyhedra, Discrete Mathematics, vol. 290, n°2-3, p. 183-210

Mahjoub A., Kerivin H. (2005), Design of Survivable Networks: A survey, Networks, vol. 46, n°1, p. 1-21

Pesneau P., Mahjoub A., Huygens D. (2004), Two edge hop-constrained paths and polyhedra, SIAM Journal on Discrete Mathematics, vol. 18, n°2, p. 287-314

Mahjoub A., Didi Biha M. (2004), The k-edge subgraph problem I: Critical extreme points, Linear Algebra and its Applications, vol. 381, p. 117-139

Mahjoub A., Mailfert J., Bendali F. (2002), Compositions of Graphs and the Triangle-Free Subgraph Polytope, Journal of Combinatorial Optimization, vol. 6, n°4, p. 359-381

Mahjoub A., Baïou M. (2002), The Steiner Traveling Salesman Polytope and Related Polyhedra, SIAM Journal on Optimization, vol. 13, n°2, p. 498-507

Mahjoub A., Kerivin H. (2002), Separation of partition inequalities for the (1,2)-survivable network design problem, Operations Research Letters, vol. 30, n°4, p. 265-268

Didi Biha M., Kerivin H., Mahjoub A. (2001), Steiner Trees and Polyhedra, Discrete Applied Mathematics, vol. 112, n°1-3, p. 101-120

Barahona F., Baïou M., Mahjoub A. (2000), Separating Partition Inequalities, Mathematics of Operations Research, vol. 25, n°2, p. 243-254

Mahjoub A., Didi Biha M. (2000), Steiner k-edge connected subgraph polyhedra, Journal of Combinatorial Optimization, vol. 4, n°1, p. 131-144

Mahjoub A., Nocq C. (1999), On the linear relaxation of the 2-node connected subgraph polytope, Discrete Applied Mathematics, vol. 95, n°1-3, p. 389-416

Bouchakour M., Mahjoub A. (1997), One-node cutsets and the dominating set polytope, Discrete Mathematics, vol. 165-166, p. 101-123

Mahjoub A. (1997), On perfectly two-edge connected graphs, Discrete Mathematics, vol. 170, n°1-3, p. 153-172

Baïou M., Mahjoub A. (1997), Steiner 2-edge connected subgraph polytopes on series-parallel graphs, SIAM Journal on Discrete Mathematics, vol. 10, n°3, p. 505-514

Didi Biha M., Mahjoub A. (1996), k-Edge connected polyhedra on series-parallel graphs, Operations Research Letters, vol. 19, n°2, p. 71-78

Mahjoub A. (1995), A min-max relation for K3-covers in graphs non contractible to K5\e, Discrete Applied Mathematics, vol. 62, n°1-3, p. 209-219

Mahjoub A., Barahona F. (1995), On two connected subgraph polytopes, Discrete Mathematics, vol. 147, n°1, p. 19-34

Barahona F., Mahjoub A. (1994), Composition of graphs and polyhedra I : Balanced induced subgraphs and acyclic subgraphs, SIAM Journal on Discrete Mathematics, vol. 7, n°3, p. 344-358

Barahona F., Mahjoub A. (1994), Composition of graphs and polyhedra II : Stable Sets, SIAM Journal on Discrete Mathematics, vol. 7, n°3, p. 359-371

Fonlupt J., Barahona F., Mahjoub A. (1994), Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs, SIAM Journal on Discrete Mathematics, vol. 7, n°3, p. 390-402

Mahjoub A. (1994), Two edge connected spanning subgraphs and polyhedra, Mathematical Programming, vol. 64, n°1-3, p. 199-208

Barahona F., Mahjoub A. (1994), Composition of graphs and polyhedra III : Graphs with No $W_4$ minor, SIAM Journal on Discrete Mathematics, vol. 7, n°3, p. 372-389

Euler R., Mahjoub A. (1991), On a composition of independence systems by circuits identification, Journal of Combinatorial Theory. Series B, vol. 53, n°2, p. 235-259

Mahjoub A., Euler R. (1991), Balanced matrices and the set covering problem, Arabian Journal for Science and Engineering, vol. 16, n°2B, p. 269-282

Brown J., Mahjoub A., Corneil D. (1990), A note on Ki-perfect graphs, Journal of Graph Theory, vol. 14, n°3, p. 333-340

Barahona F., Mahjoub A. (1989), Facets of the balanced (acyclic) induced subgraph polytope, Mathematical Programming, vol. 45, n°1-3, p. 21-33

Mahjoub A. (1988), On the stable set polytope of a series-parallel graph, Mathematical Programming, vol. 40-40, n°1-3, p. 53-57

Mahjoub A., Corneil D., Conforti M. (1987), Ki-covers. II.Ki-perfect graphs, Journal of Graph Theory, vol. 11, n°4, p. 569-584

Mahjoub A., Corneil D., Conforti M. (1986), Ki-covers I: Complexity and polytopes, Discrete Mathematics, vol. 58, n°2, p. 121-142

Mahjoub A., Barahona F. (1986), On the cut polytope, Mathematical Programming, vol. 36, n°2, p. 157-173

Mahjoub A., Grötschel M., Barahona F. (1985), Facets of the Bipartite Subgraph Polytope, Mathematics of Operations Research, vol. 10, n°2, p. 340-358

Ouvrages

Paschos V., Mahjoub A., Markakis V., Milis I. (2012), Combinatorial Optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Berlin: Springer, 476 p.

Mahjoub A. (2011), Progress in combinatorial optimization, London, Hoboken: Wiley-ISTE, 603 p.

Chapitres d'ouvrage

Mahjoub A. (2014), Polyhedral Approaches, in Vangelis Th. Paschos, Concepts of Combinatorial Optimization Wiley, p. 261-324

Baïou M., Barahona F., Mahjoub A. (2011), Partition Inequalities: Separation, Extensions and Network Design,, in Mahjoub, Ali Ridha, Progress in Combinatorial Optimization Wiley-ISTE, p. 603

Ben-Ameur W., Mahjoub A., Neto J. (2007), Le problème de coupe maximum, in Paschos, Vangelis Th., Optimisation Combinatoire 4 : problèmes paradigmatiques, Paris: Lavoisier, p. 215-XI

Mahjoub A., Fouilhoux P. (2005), Sous graphe k-partis induits et applications à la génomique et aux circuits VLSI, in Esswein, Carl, ROADEF'05 : 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Tours: Presses universitaires François Rabelais, p. 83-98

Mahjoub A. (2005), Approches polyédrales, in Vangelis Paschos, Optimisation Combinatoire 1, concepts fondamentaux, Paris: Hermès, p. 349

Kerivin H., Mahjoub A., Nocq C. (2004), (1,2)-Survivable Networks: Facets and Branch&Cut, in Grötschel, Martin, The Sharpest Cut: the Impact of Manfred Padberg and his Work, Philadelphia: Mathematical Programming Society, p. 380

Communications avec actes

Bentoumi I., Furini F., Mahjoub A., Martin S. (2022), On the Maximum Flow Blocker Problem, in , Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF)

Diarrassouba I., Hadhbi Y., Mahjoub A. (2022), Polyhedral Investigation and Branch-and-Cut Algorithm for the Spectrum Assignment Problem, in , Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF)

Diarrassouba I., Hadhbi Y., Mahjoub A. (2022), The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm, in , Piscataway, NJ, IEEE - Institute of Electrical and Electronics Engineers, 926-931 p.

Nourry C., Mahjoub A., Aissi H. (2022), Étude de formulations étendues pour le problème de l'arbre couvrant budgeté, in , Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF)

Aissi H., Mahjoub A. (2020), On the Linear Relaxation of the s-t-cut Problem with Budget Constraints, in Mourad Baïou ; Bernard Gendron ; Oktay Günlük ; A. Ridha Mahjoub, Berlin Heidelberg, Springer International Publishing, 81-88 p.

Mahjoub A., Taktak R., Uchoa E. (2019), A layered compact formulation for the Multiple Steiner TSP with Order constraints, in , Piscataway, NJ, IEEE - Institute of Electrical and Electronics Engineers, 1462-1467 p.

Aissi H., Mahjoub A., Ravi R. (2017), Randomized Contractions for Multiobjective Minimum Cuts, in Kirk Pruhs, Christian Sohler, 25th Annual European Symposium on Algorithms (ESA 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 6:1-6:13 p.

Cornaz D., Magnouche Y., Mahjoub A. (2014), On minimal two-edge-connected graphs, in , 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE - Institute of Electrical and Electronics Engineers, 251-256 p.

Aoudia L., Nguyen V., Mahjoub A., Aider M. (2014), On the star forest polytope, in , 2014 International Conference on Control, Decision and Information Technologies (CoDIT), Metz, IEEE - Institute of Electrical and Electronics Engineers, 263-268 p.

Aissi H., Mahjoub A., McCormick S., Queyranne M. (2014), A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts, in Jon Lee, Jens Vygen, Integer Programming and Combinatorial Optimization 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings, Berlin, Springer, 25-36 p.

Cornaz D., Furini F., Lacroix M., Malaguti E., Mahjoub A., Martin S. (2014), Mathematical formulations for the Balanced Vertex k-Separator Problem, in , 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE - Institute of Electrical and Electronics Engineers, 176-181 p.

Uchoa E., Mahjoub A., Simonetti L. (2012), Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem, in Voß, Stefan, Network Optimization, Hambourg, Springer, 176-181 p.

Youssef H., Meddeb A., Mahjoub A., Lourimi A., Thabti B. (2012), From constant traffic matrices to hose workload model for VPN tree design, in , XVth International Symposium on Telecommunications Network Strategy and Planning (NETWORKS), 2012 - proceedings, Rome, IEEE - Institute of Electrical and Electronics Engineers, 1-6 p.

Lacroix M., Mahjoub A., Martin S. (2012), Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem, in A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos, Combinatorial Optimization. Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Athènes, Springer, 117-128 p.

Meddeb A., Thabti B., Youssef H., Mahjoub A. (2011), Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models, in , Proceedings of the 7th International Conference on Natural Computation, Shanghai, IEEE - Institute of Electrical and Electronics Engineers, 2058-2064 p.

Mahjoub A., Gabrel V., Borne S., Taktak R. (2011), Multilayer Survivable Optical Network Design, in Voß, Stefan, Network Optimization 5th International Conference, INOC 2011, Hambourg, Springer, 670 p.

Perrot N., Mahjoub A., Benhamiche A. (2011), On the Design of Optical OFDM-Based Networks, in Voss, Stefan, Network Optimization 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011, Proceedings, Hambourg, Springer, 670 p.

Perrot N., Mahjoub A., Benhamiche A. (2010), Design of optical WDM networks, in , 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 - proceedings, Varsovie, IEEE - Institute of Electrical and Electronics Engineers

Mahjoub A., Lacroix M., Kerivin H. (2010), On the complexity of the Eulerian closed walk with precedence path constraints problem, in , ISCO International Symposium on Combinatorial Optimization, Hammamet, Electronic Notes in Discrete Mathematics, 899-906 p.

Martin S., Mahjoub A., Lacroix M. (2010), Structural Analysis for Differential-Algebraic Systems : Complexity, formulation and facets, in , ISCO International Symposium on Combinatorial Optimization, Hammamet, Electronic Notes in Discrete Mathematics, 1073-1080 p.

Lacroix M., Martin S., Mahjoub A. (2009), Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization, in Kacem, Imed, Computers and Industrial Engineering. International Conference. 2009. (CIE39), Troyes, IEEE - Institute of Electrical and Electronics Engineers, 7 p.

Mahjoub A., Cornaz D. (2009), Optimiser sur les ensembles d'arêtes des graphes bipartis induits, in Laboratoire lorrain de recherche en informatique et ses applications, ROADEF 2009, extended abstracts, livre des résumés, Nancy, LORIA, 412 p.

Bendali F., Diarrassouba I., Didi Biha M., Mahjoub A., Mailfert J. (2007), The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut, in , 6th International Workshop on Design and Reliable Communication Networks (DRCN), IEEE - Institute of Electrical and Electronics Engineers, 281-288 p.

Lacroix M., Quilliot A., Mahjoub A., Kerivin H. (2006), The capacitated vehicle routing problem with reloads, in , International Conference on Service Systems and Service Management, 2006, Troyes, IEEE - Institute of Electrical and Electronics Engineers, 1513-1518 p.

Mahjoub A., Ibrahima D., Mailfert J., Bendali F., Didi Biha M. (2006), Un algorithme de coupes et branchements pour le problème du sous graphe k-arête connexe, in Société française de recherche opérationnelle et d'aide à la décision, ROADEF'06 actes des articles longs sélectionnés lors du 7ème Congrès de la ROADEF du 6-8 février 2005 [i.e. 2006], Valenciennes, Presses universitaires de Valenciennes, 57-78 p.

Mahjoub A., Fonlupt J. (1999), Critical extreme points of the 2-edge connected spanning subgraph polytope, in Woeginger, Gerhard J., Integer Programming and Combinatorial Optimization 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, Graz, Springer, 453 p.

Mahjoub A., Barahona F. (1992), On two connected subgraph polytopes, in Kannan, Ravi, Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992, Pittsburgh, Carnegie Mellon University, 30-43 p.

Mahjoub A. (1983), Polytope Des Absorbants Dans Une Classe De Graphe a Seuil, in C. Berge, D. Bresson, P. Camion, J.F. Maurras and F. Sterboul, Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics, Elsevier, 443-452 p.

Communications sans actes

Sadykov R., Pereira Vargas Liguori P., Mahjoub A., Marques G., Uchoa E. (2022), Non-Robust Strong Knapsack Cuts for Capacitated Location-Routing and Related Problems, Journée commune ROADEF / AIRO, Virtual, France

Hanafi S., Mahjoub A., Taktak R., Wilbaut C. (2021), Variable-Sized Bin Packing Problem with Color Constraints, JPOC 12 : Journées Polyèdres et Optimisation Combinatoire, France

Pereira Vargas Liguori P., Mahjoub A., Sadykov R., Uchoa E. (2019), A Branch-Cut-and-Price Algorithm for the Location-Routing Problem, TRISTAN X - The Tenth Triennial Symposium on Transportation Analysis, Hamilton Island, Australie

Gabrel V., Borne S., Mahjoub A., Taktak R. (2010), Design of Multilayer Survivable Optical Networks, ISCO International Symposium on Combinatorial Optimization, Hammamet, Tunisie

Mahjoub A., Diarrassouba I., Gabrel V. (2010), Le problème de conception de réseau fiable avec contrainte de borne, Congrès ROADEF 2010, Toulouse, France

Gabrel V., Mahjoub A., Taktak R. (2010), Le problème de sécurisation multicouche du réseau optique, Congrès ROADEF 2010, Toulouse, France

Gabrel V., Taktak R., Mahjoub A. (2010), Design of Multilayer Survivable Optical Networks, 24th European Conference on Operational Research, Lisbonne, Portugal

Mahjoub A., Diarrassouba I., Gabrel V. (2010), Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem, 24th European Conference on Operational Research, Lisbonne, Portugal

McCormick T., Mahjoub A. (2010), Separation Algorithms for Single-Machine Scheduling with Precedence Constraints, ISCO International Symposium on Combinatorial Optimization, Hammamet, Tunisie

Fouilhoux P., Mahjoub A., Klopkenstein O., Ekin-Karazan O. (2009), The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut, INOC 2009 International Network Optimization Conference, Pise, Italie

Yaman H., Mahjoub A., Fouilhoux P., Ozbök O., Ekin-Karazan O. (2009), Survivability in hierarchical telecommunications networks, INOC 2009 International Network Optimization Conference, Pise, Italie

Didi Biha M., Slama L., Mahjoub A. (2005), On the separation of partition inequalities, International Network Optimization Conference INOC 2005, Lisbonne, Portugal

Mahjoub A., Labbé M., Pesneau P., Huygens D. (2005), Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut, International Network Optimization Conference INOC 2005, Lisbonne, Portugal

Gourdin E., Borne S., Liau B., Mahjoub A. (2003), Design of Survivable IP-over-Optical Networks, INOC'2003 - International Network Optimization Conference, Evry, France

Mahjoub A., Kerivin H., Didi Biha M. (1998), Une approche polyédrale pour le problème de l'arbre Steiner, 6èmes journées du groupe MODE de la SMAI, Poitiers, France

Tanguy M., Daoud M., Mahjoub A. (1997), Techniques de Flots et comparaison d'images en 2D, 16ème Colloque GRETSI, Grenoble, France

Actes d'une conférence

Ljubic I., Barahona F., Dey S., Mahjoub A. (2022), Combinatorial Optimization: 7th International Symposium, ISCO 2022, in , Springer, 337 p

Lee J., Rinaldi G., Mahjoub A. (2018), Combinatorial Optimization: 5th International Symposium, ISCO 2018, in , Berlin Heidelberg, Springer, 430 p

Prépublications / Cahiers de recherche

Diarrassouba I., Mahjoub A. (2023), Polyhedral Investigation of k Edge-Connected L-Hop-Constrained Network Design Problem, Paris, Preprint Lamsade, 1-67 p.

Pereira Vargas Liguori P., Mahjoub A., Marques G., Uchoa E., Sadykov R. (2022), Non-Robust Strong Knapsack Cuts for Capacitated Location-Routing and Related Problems, Paris, Preprint Lamsade

Diarrassouba I., Hadhbi Y., Mahjoub A. (2021), On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I, Paris, Preprint Lamsade

Diarrassouba I., Hadhbi Y., Mahjoub A. (2021), Valid Inequalities and Branch-and-Cut-and-Price Algorithm for the Constrained-Routing and Spectrum Assignment Problem...., Paris, Preprint Lamsade

Diarrassouba I., Hadhbi Y., Mahjoub A. (2021), On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part II, Paris, Preprint Lamsade