2012

Articles

• Picouleau, Christophe ; Martin, Sébastien ; Mahjoub, Ali Ridha ; Lacroix, Mathieu . On the NP-completeness of the perfect matching free subgraph problem. Theoretical Computer Science. Volume 423. 2012. pages 25-29. Elsevier. DOI http://dx.doi.org/10.1016/j.tcs.2011.12.065.
• Kerivin, Hervé ; Lacroix, Mathieu ; Mahjoub, Ali Ridha . Models for the single-vehicle preemptive pickup and delivery problem. Journal of Combinatorial Optimization. Volume 23. n° 2. 2012. pages 196-223. Springer. DOI http://dx.doi.org/10.1007/s10878-010-9349-z.
• Mahjoub, Ali Ridha ; Fouilhoux, Pierre . Solving VLSI design and DNA sequencing problems using bipartization of graphs. Computational Optimization and Applications. Volume 51. n° 2. 2012. pages 749-781. Springer. DOI http://dx.doi.org/10.1007/s10589-010-9355-1.
• Yaman, Hande ; Özkök, Onur ; Mahjoub, Ali Ridha ; Ekin-Karasan, Oya ; Fouilhoux, Pierre . Survivability in hierarchical telecommunications networks. Networks. Volume 59. n° 1. 2012. pages 37-58. Wiley. DOI http://dx.doi.org/10.1002/net.20479.

Conference Contributions

• Uchoa, Eduardo ; Simonetti, Luidi ; Mahjoub, Ali Ridha . Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. INOC 2011. Hambourg. Allemagne. 2012.
• Martin, Sébastien ; Mahjoub, Ali Ridha ; Lacroix, Mathieu . Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. Combinatorial Optimization. Second International Symposium, ISCO 2012, Athens, Greece, 19-21, Revised Selected Papers. Athènes. Grèce. 2012.

2011

Articles

• Martin, Sébastien ; Mahjoub, Ali Ridha ; Lacroix, Mathieu . Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.. Computers & Industrial Engineering. Volume 61. n° 2. 2011. pages 422-429. Elsevier. DOI http://dx.doi.org/10.1016/j.cie.2010.12.002.

Book chapters

• Mahjoub, Ali Ridha ; Barahona, Francisco ; Baïou, Mourad . Partition Inequalities: Separation, Extensions and Network Design,. Mahjoub, Ali Ridha. Progress in Combinatorial Optimization. . 2011. pages 1-39.

Conference Contributions

• Taktak, Raouia ; Mahjoub, Ali Ridha ; Gabrel, Virginie ; Borne, Sylvie . Multilayer Survivable Optical Network Design. INOC, 2011. Hambourg. Allemagne. 2011.
• Thabti, Boulbaba ; Meddeb, Aref ; Mahjoub, Ali Ridha ; Youssef, Habib . Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models. Proceedings of the 7th International Conference on Natural Computation. Shanghai. Chine. 2011.

Working Papers

• Lacroix, Mathieu ; Mahjoub, Ali Ridha ; Martin, Sébastien ; Picouleau, Christophe . On the NP-Completeness of the Perfect Matching Free Subgraph Problem. Université Paris-Dauphine . 2011 .

Books

• Mahjoub, Ali Ridha . Progress in combinatorial optimization. London, Hoboken. ISTE - WILEY . 2011 . pages 603 . ISBN 978-1-84821-206-0 .

2010

Articles

• Bendali, Fatiha ; Mahjoub, Ali Ridha ; Mailfert, Jean ; Diarrassouba, Ibrahima . The k edge-disjoint 3-hop-constrained paths polytope. Discrete Optimization. Volume 7. n° 4. 2010. pages 222-233. Elsevier. DOI http://dx.doi.org/10.1016/j.disopt.2010.05.001.
• Mailfert, Jean ; Mahjoub, Ali Ridha ; Didi Biha, Mohamed ; Ibrahima, Diarrassouba ; Bendali, Fatiha . A Branch-and-Cut algorithm for the k-edge connected subgraph problem. Networks. Volume 55. n° 1. 2010. pages 13-32. Wiley Periodicals. DOI http://dx.doi.org/10.1002/net.20310.
• Mahjoub, Ali Ridha ; McCormick, Thomas . Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Mathematical Programming. Volume 124. n° 1-2. 2010. pages 271-284. Springer. DOI http://dx.doi.org/10.1007/s10107-010-0366-6.

Conference Contributions

• Gabrel, Virginie ; Mahjoub, Ali Ridha ; Taktak, Raouia . Le problème de sécurisation multicouche du réseau optique. Congrès ROADEF 2010. Toulouse. France. 2010.
• Diarrassouba, Ibrahima ; Gabrel, Virginie ; Mahjoub, Ali Ridha . Le problème de conception de réseau fiable avec contrainte de borne. Congrès ROADEF 2010. Toulouse. France. 2010.
• Mahjoub, Ali Ridha ; Lacroix, Mathieu ; Kerivin, Hervé . On the complexity of the Eulerian closed walk with precedence path constraints problem. Electronic Notes in Discrete Mathematics. Hammamet. Tunisie. 2010.
• Gabrel, Virginie ; Mahjoub, Ali Ridha ; Taktak, Raouia . Design of Multilayer Survivable Optical Networks. 24th European Conference on Operational Research. Lisbonne. Portugal. 2010.
• Mahjoub, Ali Ridha ; Lacroix, Mathieu ; Martin, Sébastien . Structural Analysis for Differential-Algebraic Systems : Complexity, formulation and facets. Electronic Notes in Discrete Mathematics. Hammamet. Tunisie. 2010.
• Mahjoub, Ali Ridha ; Diarrassouba, Ibrahima ; Gabrel, Virginie . Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem. 24th European Conference on Operational Research. Lisbonne. Portugal. 2010.
• Mahjoub, Ali Ridha ; McCormick, Thomas . Separation Algorithms for Single-Machine Scheduling with Precedence Constraints. ISCO International Symposium on Combinatorial Optimization. Hammamet. Tunisie. 2010.
• Benhamiche, Amal ; Mahjoub, Ali Ridha ; Perrot, Nancy . Design of optical WDM networks. ISCO International Symposium on Combinatorial Optimization. Hammamet. Tunisie. 2010.
• Borne, Sylvie ; Gabrel, Virginie ; Mahjoub, Ali Ridha ; Taktak, Raouia . Design of Multilayer Survivable Optical Networks. ISCO International Symposium on Combinatorial Optimization. Hammamet. Tunisie. 2010.

2009

Articles

• Fouilhoux, Pierre ; Labbé, Martine ; Mahjoub, Ali Ridha ; Yaman, Hande . Generating Facets for the Independence System Polytope. SIAM Journal on Discrete Mathematics. Volume 23. n° 3. 2009. pages 1484-1506. SIAM. DOI http://dx.doi.org/10.1137/070695988.
• Kacem, Imed ; Mahjoub, Ali Ridha . Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers and Industrial Engineering. Volume 56. n° 4. 2009. pages 1708-1712. Elsevier. DOI http://dx.doi.org/10.1016/j.cie.2008.09.042.

Conference Contributions

• Mahjoub, Ali Ridha ; Cornaz, Denis . Optimiser sur les ensembles d'arêtes des graphes bipartis induits. ROADEF 2009, 10ème Congrès de la société française de recherche opérationnelle et d'aide à la décision. Nancy. France. 2009.
• Ekin-Karazan, Oya ; Fouilhoux, Pierre ; Klopkenstein, Olivier ; Mahjoub, Ali Ridha . The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut. INOC 2009 International Network Optimization Conference. Pise. Italie. 2009.
• Mahjoub, Ali Ridha ; Fouilhoux, Pierre ; Ekin-Karazan, Oya ; Yaman, Hande ; Ozbök, Onur . Survivability in hierarchical telecommunications networks. INOC 2009 International Network Optimization Conference. Pise. Italie. 2009.
• Martin, Sébastien ; Mahjoub, Ali Ridha ; Lacroix, Mathieu . Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization. Computers and Industrial Engineering. International Conference. 2009. (CIE39). Troyes. France. 2009.

2008

Articles

• Mahjoub, Ali Ridha ; Kerivin, Hervé ; Didi Biha, Mohamed . On the (1,2)-Survivable Network Design Polytope. SIAM Journal on Discrete Mathematics. Volume 22. n° 4. 2008. pages 1640- 1666. Society for Industrial and Applied Mathematics. DOI http://dx.doi.org/10.1137/050639600.
• Bouchakour, Mustapha ; Contenza, Teresa ; Lee, C.W ; Mahjoub, Ali Ridha . On the dominating set polytope. European Journal of Combinatorics. Volume 29. n° 3. 2008. pages 652-661. Elsevier. DOI http://dx.doi.org/10.1016/j.ejc.2007.03.010.
• Kerivin, Hervé ; Lacroix, Mathieu ; Mahjoub, Ali Ridha ; Quilliot, Alain . The splittable pickup and delivery problem with reloads. European Journal of Industrial Engineering. Volume 2. n° 2. 2008. pages 112-133. Inderscience Enterprises Limited. DOI http://dx.doi.org/10.1504/EJIE.2008.017347.
• Mahjoub, Ali Ridha ; Pesneau, Pierre . On the Steiner 2-edge connected subgraph polytope. RAIRO Operations Research. Volume 42. n° 3. 2008. pages 259-283. EDP Sciences. DOI http://dx.doi.org/10.1051/ro:2008022.

2007

Articles

• Pesneau, Pierre ; Mahjoub, Ali Ridha ; Labbé, Martine ; Huygens, David . The Two-Edge Connected Hop-Constrained Network Design Problem : Valid Inequalities and Branch-and-Cut. Networks. Volume 49. n° 1. 2007. pages 116-133. Wiley. DOI http://dx.doi.org/10.1002/net.20146.
• Cornaz, Denis ; Mahjoub, Ali Ridha . The maximum induced bipartite subgraph problem with edge weights. SIAM Journal on Discrete Mathematics. Volume 21. n° 3. 2007. pages 662-675. SIAM. DOI http://dx.doi.org/10.1137/060650015.

Book chapters

• Ben-Ameur, Walid ; Mahjoub, Ali Ridha ; Neto, José . Le problème de coupe maximum. Paschos, Vangelis Th.. Optimisation Combinatoire 4 : problèmes paradigmatiques. Paris. 2007. pages 17-59.

2006

Articles

• Fouilhoux, Pierre ; Mahjoub, Ali Ridha . Polyhedral results for the bipartite induced subgraph problem. Discrete Applied Mathematics. Volume 154. n° 15. 2006. pages 2128-2149. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2005.04.017.
• Pesneau, Pierre ; Mahjoub, Ali Ridha ; McCormick, Thomas ; Fortz, bernard . Two-edge connected subgraph with bounded rings problem: Polyhedral results and Branch-and-Cut. Mathematical Programming. Volume 105. n° 1. 2006. pages 85-111. Springer. DOI http://dx.doi.org/10.1007/s10107-005-0576-5.
• Dahl, Geir ; Huygens, David ; Mahjoub, Ali Ridha ; Pesneau, Pierre . On the k edge-disjoint 2-hop-constrained paths polytope. Operations Research Letters. Volume 34. n° 5. 2006. pages 577-582. Elsevier. DOI http://dx.doi.org/10.1016/j.orl.2005.09.001.
• Mahjoub, Ali Ridha ; Mailfert, Jean . On the independent dominating set polytope. European Journal of Combinatorics. Volume 27. n° 4. 2006. pages 601-616. Elsevier. DOI http://dx.doi.org/10.1016/j.ejc.2004.07.015.
• Fonlupt, Jean ; Mahjoub, Ali Ridha . Critical extreme points of the 2-edge connected subgraph polytope. Mathematical Programming. Volume 105. n° 2-3. 2006. pages 289-310. Springer Berlin. DOI http://dx.doi.org/10.1007/s10107-005-0654-8.

Conference Contributions

• Kerivin, Hervé ; Lacroix, Mathieu ; Mahjoub, Ali Ridha ; Quilliot, Alain . The capacitated vehicle routing problem with reloads. IEEE International Conference on Service Systems and Service Management (ICSSSM’06). Troyes. France. 2006.
• Bendali, Fatiha ; Ibrahima, Diarrassouba ; Didi Biha, Mohamed ; Mahjoub, Ali Ridha ; Mailfert, Jean . Un algorithme de coupes et branchements pour le problème du sous graphe k-arête connexe. 7ème Congrès de la ROADEF. Valenciennes. France. 2005.

2005

Articles

• Mahjoub, Ali Ridha ; Kerivin, Hervé . On Survivable Network Polyhedra. Discrete Mathematics. Volume 290. n° 2-3. 2005. pages 183-210. Elsevier. DOI http://dx.doi.org/10.1016/j.disc.2004.08.017.
• Kerivin, Hervé ; Mahjoub, Ali Ridha . Design of Survivable Networks: A survey. Networks. Volume 46. n° 1. 2005. pages 1-21. Wiley. DOI http://dx.doi.org/10.1002/net.20072.

Book chapters

• Fouilhoux, Pierre ; Mahjoub, Ali Ridha . Sous graphe k-partis induits et applications à la génomique et aux circuits VLSI. Esswein, Carl; Billaut, Jean-Charles. ROADEF'05 : 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision. Tours. 2005. pages 83-98.
• Mahjoub, Ali Ridha . Approches polyédrales. Vangelis Paschos. Optimisation Combinatoire 1, concepts fondamentaux. Paris. 2005.

Conference Contributions

• Huygens, David ; Labbé, Martine ; Mahjoub, Ali Ridha ; Pesneau, Pierre . Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut. International Network Optimization Conference INOC 2005. Lisbonne. Portugal. 2005.
• Didi Biha, Mohamed ; Mahjoub, Ali Ridha ; Slama, Lise . On the separation of partition inequalities. International Network Optimization Conference INOC 2005. Lisbonne. Portugal. 2005.

2004

Articles

• Didi Biha, Mohamed ; Mahjoub, Ali Ridha . The k-edge subgraph problem I: Critical extreme points. Linear Algebra and its Applications. Volume 381. 2004. pages 117-139. Elsevier. DOI http://dx.doi.org/10.1016/j.laa.2003.11.007.
• Pesneau, Pierre ; Mahjoub, Ali Ridha ; Huygens, David . Two edge hop-constrained paths and polyhedra. SIAM journal on Discrete Mathematics. Volume 18. n° 2. 2004. pages 287-314. Siam. DOI http://dx.doi.org/10.1137/S0895480102419445.

Book chapters

• Kerivin, Hervé ; Mahjoub, Ali Ridha ; Nocq, Charles . (1,2)-Survivable Networks: Facets and Branch&Cut. Grötschel, Martin. The Sharpest Cut: the Impact of Manfred Padberg and his Work. Philadelphia. 2004. pages 121-152.

2003

Conference Contributions

• Borne, Sylvie ; Gourdin, Eric ; Liau, Bernard ; Mahjoub, Ali Ridha . Design of Survivable IP-over-Optical Networks. INOC'2003 - International Network Optimization Conference. Evry. France. 2003.

2002

Articles

• Kerivin, Hervé ; Mahjoub, Ali Ridha . Separation of partition inequalities for the (1,2)-survivable network design problem. Operations Research Letters. Volume 30. n° 4. 2002. pages 265-268. Elsevier. DOI http://dx.doi.org/10.1016/S0167-6377(02)00182-7.
• Baïou, Mourad ; Mahjoub, Ali Ridha . The Steiner Traveling Salesman Polytope and Related Polyhedra. SIAM Journal on Optimization. Volume 13. n° 2. 2002. pages 498-507. SIAM. DOI http://dx.doi.org/10.1137/S1052623400322287.
• Bendali, Fatiha ; Mailfert, Jean ; Mahjoub, Ali Ridha . Compositions of Graphs and the Triangle-Free Subgraph Polytope. Journal of Combinatorial Optimization. Volume 6. n° 4. 2002. pages 359-381. Springer. DOI http://dx.doi.org/10.1023/A:1019518830361.

2001

Articles

• Didi Biha, Mohamed ; Kerivin, Hervé ; Mahjoub, Ali Ridha . Steiner Trees and Polyhedra. Discrete Applied Mathematics. Volume 112. n° 1-3. 2001. pages 101-120. Elsevier. DOI http://dx.doi.org/10.1016/S0166-218X(00)00311-5.

2000

Articles

• Didi Biha, Mohamed ; Mahjoub, Ali Ridha . Steiner k-edge connected subgraph polyhedra. Journal of Combinatorial Optimization. Volume 4. n° 1. 2000. pages 131-144. Kluwer Academic Publishers. DOI http://dx.doi.org/10.1023/A:1009893108387.
• Baïou, Mourad ; Barahona, Francisco ; Mahjoub, Ali Ridha . Separating Partition Inequalities. Mathematics of Operations Research. Volume 25. n° 2. 2000. pages 243-254. Informs. DOI http://dx.doi.org/10.1287/moor.25.2.243.12223.

1999

Articles

• Mahjoub, Ali Ridha ; Nocq, Charles . On the linear relaxation of the 2-node connected subgraph polytope. Discrete Applied Mathematics. Volume 95. n° 1-3. 1999. pages 389-416. Elsevier. DOI http://dx.doi.org/10.1016/S0166-218X(99)00088-8.

Conference Contributions

• Fonlupt, Jean ; Mahjoub, Ali Ridha . Critical extreme points of the 2-edge connected spanning subgraph polytope. 7th International IPCO Conference (IPCO'99). Graz. Autriche. 1999.

1998

Conference Contributions

• Didi Biha, Mohamed ; Kerivin, Hervé ; Mahjoub, Ali Ridha . Une approche polyédrale pour le problème de l'arbre Steiner. 6èmes journées du groupe MODE de la SMAI. Poitiers. France. 1998.

1997

Articles

• Baïou, Mourad ; Mahjoub, Ali Ridha . Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM Journal on Discrete Mathematics. Volume 10. n° 3. 1997. pages 505-514. SIAM. DOI http://dx.doi.org/10.1137/S0895480193259813.
• Mahjoub, Ali Ridha . On perfectly two-edge connected graphs. Discrete Mathematics. Volume 170. n° 1-3. 1997. pages 153-172. Elsevier. DOI http://dx.doi.org/10.1016/S0012-365X(96)00004-0.
• Bouchakour, Mustapha ; Mahjoub, Ali Ridha . One-node cutsets and the dominating set polytope. Discrete Mathematics. Volume 165-166. 1997. pages 101-123. Elsevier. DOI http://dx.doi.org/10.1016/S0012-365X(96)00164-1.

Conference Contributions

• Daoud, Moncef ; Mahjoub, Ali Ridha ; Tanguy, Michael . Techniques de Flots et comparaison d'images en 2D. 16ème Colloque GRETSI. Grenoble. France. 1997.

1996

Articles

• Didi Biha, Mohamed ; Mahjoub, Ali Ridha . k-Edge connected polyhedra on series-parallel graphs. Operations Research Letters. Volume 19. n° 2. 1996. pages 71-78. Elsevier. DOI http://dx.doi.org/10.1016/0167-6377(96)00015-6.

1995

Articles

• Mahjoub, Ali Ridha ; Barahona, Francisco . On two connected subgraph polytopes. Discrete Mathematics. Volume 147. n° 1. 1995. pages 19-34. Elsevier. DOI http://dx.doi.org/10.1016/0012-365X(94)00255-H.
• Mahjoub, Ali Ridha . A min-max relation for K3-covers in graphs non contractible to K5e. Discrete Applied Mathematics. Volume 62. n° 1-3. 1995. pages 209-219. Elsevier. DOI http://dx.doi.org/10.1016/0166-218X(94)00153-5.

1994

Articles

• Barahona, Francisco ; Fonlupt, Jean ; Mahjoub, Ali Ridha . Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM Journal on Discrete Mathematics. Volume 7. n° 3. 1994. pages 390-402. SIAM. DOI http://dx.doi.org/10.1137/S0895480190182691.
• Barahona, Francisco ; Mahjoub, Ali Ridha . Composition of graphs and polyhedra III : Graphs with No $W_4$ minor. SIAM Journal on Discrete Mathematics. Volume 7. n° 3. 1994. pages 372-389. SIAM. DOI http://dx.doi.org/10.1137/S089548019018268X.
• Barahona, Francisco ; Mahjoub, Ali Ridha . Composition of graphs and polyhedra I : Balanced induced subgraphs and acyclic subgraphs. SIAM Journal on Discrete Mathematics. Volume 7. n° 3. 1994. pages 344-358. SIAM. DOI http://dx.doi.org/10.1137/S0895480190182666.
• Mahjoub, Ali Ridha . Two edge connected spanning subgraphs and polyhedra. Mathematical Programming. Volume 64. n° 1-3. 1994. pages 199-208. Springer. DOI http://dx.doi.org/10.1007/BF01582572.
• Barahona, Francisco ; Mahjoub, Ali Ridha . Composition of graphs and polyhedra II : Stable Sets. SIAM Journal on Discrete Mathematics. Volume 7. n° 3. 1994. pages 359-371. Society for Industrial and Applied Mathematics. DOI http://dx.doi.org/10.1137/S0895480190182678.

1992

Conference Contributions

• Barahona, Francisco ; Mahjoub, Ali Ridha . On two connected subgraph polytopes. 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992. Pittsburgh. États-Unis. 1992.

1991

Articles

• Euler, Reinhardt ; Mahjoub, Ali Ridha . On a composition of independence systems by circuits identification. Journal of Combinatorial Theory , Series B. Volume 53. n° 2. 1991. pages 235-259. Elsevier. DOI http://dx.doi.org/10.1016/0095-8956(91)90076-V.
• Mahjoub, Ali Ridha ; Euler, Reinhardt . Balanced matrices and the set covering problem. Arabian Journal for Science and Engineering. Volume 16. n° 2B. 1991. pages 269-282. King Fahd University for Petroleum and Mineral.