Integer linear programming formulations for the maximum flow blocker problem - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (Eur. J. Oper. Res., 2025)

Design of survivable networks with low connectivity requirements - Fatmah Almathkour; Youcef Magnouche; Ali Ridha Mahjoub; Raouia Taktak (Int. Trans. Oper. Res., 2025)

The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (J. Comb. Optim., 2025)

Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem - Ibrahima Diarrassouba; Youssouf Hadhbi; Ali Ridha Mahjoub (J. Comb. Optim., 2024)

On the minimum s-t cut problem with budget constraints - Hassene Aissi; Ali Ridha Mahjoub (Math. Program., 2024)

Optimization algorithms for the k edge-connected L-hop-constrained network design problem - I. Diarrassouba; Ali Ridha Mahjoub; Intesar M. Al-Mudahka (Soft Comput., 2024)

Combinatorial Optimization - 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024, Revised Selected Papers - Amitabh Basu; Ali Ridha Mahjoub; Juan José Salazar González (Springer, 2024)

Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut - Intesar M. Al-Mudahka; Ibrahima Diarrassouba; Ali Ridha Mahjoub; Raouia Taktak (Comput. Ind. Eng., 2023)

Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems - Pedro Henrique P. V. Liguori; Ali Ridha Mahjoub; Guillaume Marquès; Ruslan Sadykov; Eduardo Uchoa (Oper. Res., 2023)

A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (9th International Conference on Control, Decision and Information Technologies, CoDIT 2023, Rome, Italy, July 3-6, 2023, 2023)

Preface: Combinatorial Optimization ISCO 2018 - Jon Lee; Ali Ridha Mahjoub; Giovanni Rinaldi (Discret. Appl. Math., 2022)

The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm - Ibrahima Diarrassouba; Youssouf Hadhbi; Ali Ridha Mahjoub (8th International Conference on Control, Decision and Information Technologies, CoDIT 2022, Istanbul, Turkey, May 17-20, 2022, 2022)

Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers - Ivana Ljubic; Francisco Barahona; Santanu S. Dey; Ali Ridha Mahjoub (Springer, 2022)

Preface: New trends on combinatorial optimization for network and logistical applications - Imed Kacem; Hans Kellerer; Ali Ridha Mahjoub (Ann. Oper. Res., 2021)

The multi-terminal vertex separator problem: Branch-and-Cut-and-Price - Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (Discret. Appl. Math., 2021)

Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Discret. Optim., 2020)

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms - Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (Soft Comput., 2020)

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints - Hassene Aissi; Ali Ridha Mahjoub (Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers, 2020)

Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers - Mourad Baïou; Bernard Gendron; Oktay Günlük; Ali Ridha Mahjoub (Springer, 2020)

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (Discret. Appl. Math., 2019)

The vertex k-cut problem - Denis Cornaz; Fabio Furini; Mathieu Lacroix; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016 - Satoru Fujishige; Ali Ridha Mahjoub; Franz Rendl (J. Comb. Optim., 2019)

On the star forest polytope for trees and cycles - Méziane Aïder; Lamia Aoudia; Mourad Baïou; Ali Ridha Mahjoub; Viet Hung Nguyen (RAIRO Oper. Res., 2019)

Distance Transformation for Network Design Problems - Ali Ridha Mahjoub; Michael Poss; Luidi Simonetti; Eduardo Uchoa (SIAM J. Optim., 2019)

A parallel hybrid optimization algorithm for some network design problems - Ibrahima Diarrassouba; Mohamed Khalil Labidi; Ali Ridha Mahjoub (Soft Comput., 2019)

A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing - Okan Arslan; Oya Ekin Karasan; Ali Ridha Mahjoub; Hande Yaman (Transp. Sci., 2019)

A special case of Variable-Sized Bin Packing Problem with Color Constraints - Igor Crévits; Saïd Hanafi; Ali Ridha Mahjoub; Raouia Taktak; Christophe Wilbaut (6th International Conference on Control, Decision and Information Technologies, CoDIT 2019, Paris, France, April 23-26, 2019, 2019)

A layered compact formulation for the Multiple Steiner TSP with Order constraints - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (6th International Conference on Control, Decision and Information Technologies, CoDIT 2019, Paris, France, April 23-26, 2019, 2019)

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub; Hande Yaman (Ann. des Télécommunications, 2018)

Assessing the risk of complex ICT systems - Nizar Kheir; Ali Ridha Mahjoub; Mohamed Yassine Naghmouchi; Nancy Perrot; Jean-Philippe Wary (Ann. des Télécommunications, 2018)

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem - Sylvie Borne; Éric Gourdin; Olivier Klopfenstein; Ali Ridha Mahjoub (Comput. Ind. Eng., 2018)

Minimal arc-sets spanning dicycles - Denis Cornaz; Hervé Kerivin; Ali Ridha Mahjoub (Discret. Appl. Math., 2018)

A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems - Ali Ridha Mahjoub; Mohamed Yassine Naghmouchi; Nancy Perrot (Electron. Notes Discret. Math., 2018)

A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem - Ibrahima Diarrassouba; Mohamed Khalil Labidi; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 2018)

The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut - Ibrahima Diarrassouba; Pedro Henrique P. V. Liguori; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 2018)

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP - Pierre Fouilhoux; Ali Ridha Mahjoub; Alain Quilliot; Hélène Toussaint (RAIRO Oper. Res., 2018)

Optimization algorithms for the disjunctively constrained knapsack problem - Mariem Ben Salem; Raouia Taktak; Ali Ridha Mahjoub; Hanêne Ben-Abdallah (Soft Comput., 2018)

Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers - Jon Lee; Giovanni Rinaldi; Ali Ridha Mahjoub (Springer, 2018)

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut - Meriem Mahjoub; I. Diarrassouba; Ali Ridha Mahjoub; Raouia Taktak (Comput. Ind. Eng., 2017)

Randomized Contractions for Multiobjective Minimum Cuts - Hassene Aissi; Ali Ridha Mahjoub; R. Ravi (25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017)

Unsplittable non-additive capacitated network design using set functions polyhedra - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Comput. Oper. Res., 2016)

Preface - Luis Eduardo Neves Gouveia; Andrea Lodi; Ali Ridha Mahjoub (Discret. Optim., 2016)

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub; Raouia Taktak (Electron. Notes Discret. Math., 2016)

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem - I. Diarrassouba; Virginie Gabrel; Ali Ridha Mahjoub; Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2016)

Two node-disjoint hop-constrained survivable network design and polyhedra - Ibrahima Diarrassouba; Hakan Kutucu; Ali Ridha Mahjoub (Networks, 2016)

A New Risk Assessment Framework Using Graph Theory for Complex ICT Systems - Mohamed Yassine Naghmouchi; Nancy Perrot; Nizar Kheir; Ali Ridha Mahjoub; Jean-Philippe Wary (Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, MIST@CCS 2016, Vienna, Austria, October 28, 2016, 2016)

Polyhedral analysis for the disjunctively constrained Knapsack Problem - Mariem Ben Salem; Raouia Taktak; Hanêne Ben-Abdallah; Ali Ridha Mahjoub (International Conference on Control, Decision and Information Technologies, CoDIT 2016, Saint Julian's, Malta, April 6-8, 2016, 2016)

The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price - Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (International Conference on Control, Decision and Information Technologies, CoDIT 2016, Saint Julian's, Malta, April 6-8, 2016, 2016)

The k-node-connected subgraph problem: Facets and Branch-and-Cut - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub (12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016, 2016)

A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem - Mohamed Khalil Labidi; Ibrahima Diarrassouba; Ali Ridha Mahjoub; Anissa Omrane (Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016, 2016)

Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers - Raffaele Cerulli; Satoru Fujishige; Ali Ridha Mahjoub (Springer, 2016)

Preface - Ali Ridha Mahjoub; Giovanni Rinaldi; Gerhard J. Woeginger (Math. Program., 2015)

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs - Hassene Aissi; Ali Ridha Mahjoub; S. Thomas McCormick; Maurice Queyranne (Math. Program., 2015)

Preface - Dominique de Werra; Nelson Maculan; Ali Ridha Mahjoub (Discret. Appl. Math., 2014)

Survivability in Hierarchical Telecommunications Networks Under Dual Homing - Oya Ekin Karasan; Ali Ridha Mahjoub; Onur Özkök; Hande Yaman (INFORMS J. Comput., 2014)

Preface - Nelson Maculan; Ali Ridha Mahjoub; Eduardo Uchoa (RAIRO Oper. Res., 2014)

Mathematical formulations for the Balanced Vertex k-Separator Problem - Denis Cornaz; Fabio Furini; Mathieu Lacroix; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014, 2014)

On minimal two-edge-connected graphs - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub (International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014, 2014)

On the star forest polytope - Lamia Aoudia; Viet Hung Nguyen; Ali Ridha Mahjoub; Méziane Aïder (International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014, 2014)

Simulated evolution based algorithm versus exact method for virtual private network design - Boulbaba Thabti; Habib Youssef; Ali Ridha Mahjoub; Aref Meddeb (10th International Conference on Natural Computation, ICNC 2014, Xiamen, China, August 19-21, 2014, 2014)

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts - Hassene Aissi; Ali Ridha Mahjoub; S. Thomas McCormick; Maurice Queyranne (Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings, 2014)

Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers - Pierre Fouilhoux; Luis Eduardo Neves Gouveia; Ali Ridha Mahjoub; Vangelis Th. Paschos (Springer, 2014)

Hose workload based exact algorithm for the optimal design of virtual private networks - Ibrahima Diarrassouba; Ali Lourimi; Ali Ridha Mahjoub; Habib Youssef (Comput. Networks, 2013)

Capacitated Network Design using Bin-Packing - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Electron. Notes Discret. Math., 2013)

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints - Sylvie Borne; Ali Ridha Mahjoub; Raouia Taktak (Electron. Notes Discret. Math., 2013)

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra - Ibrahima Diarrassouba; Hakan Kutucu; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 2013)

Hop-level flow formulation for the survivable network design with hop constraints problem - Ali Ridha Mahjoub; Luidi Simonetti; Eduardo Uchoa (Networks, 2013)

Solving VLSI design and DNA sequencing problems using bipartization of graphs - Pierre Fouilhoux; Ali Ridha Mahjoub (Comput. Optim. Appl., 2012)

Models for the single-vehicle preemptive pickup and delivery problem - Hervé Kerivin; Mathieu Lacroix; Ali Ridha Mahjoub (J. Comb. Optim., 2012)

Survivability in hierarchical telecommunications networks - Pierre Fouilhoux; Oya Ekin Karasan; Ali Ridha Mahjoub; Onur Özkök; Hande Yaman (Networks, 2012)

On the NP-completeness of the perfect matching free subgraph problem - Mathieu Lacroix; Ali Ridha Mahjoub; Sébastien Martin; Christophe Picouleau (Theor. Comput. Sci., 2012)

On the complexity of the Eulerian closed walk with precedence path constraints problem - Hervé Kerivin; Mathieu Lacroix; Ali Ridha Mahjoub (Theor. Comput. Sci., 2012)

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem - Mathieu Lacroix; Ali Ridha Mahjoub; Sébastien Martin (Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, 2012)

Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers - Ali Ridha Mahjoub; Vangelis Markakis; Ioannis Milis; Vangelis Th. Paschos (Springer, 2012)

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems - Mathieu Lacroix; Ali Ridha Mahjoub; Sébastien Martin (Comput. Ind. Eng., 2011)

Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models - Boulbaba Thabti; Habib Youssef; Aref Meddeb; Ali Ridha Mahjoub (Seventh International Conference on Natural Computation, ICNC 2011, Shanghai, China, 26-28 July, 2011, 2011)

On the Design of Optical OFDM-Based Networks - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

Multilayer Survivable Optical Network Design - Sylvie Borne; Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem - Ali Ridha Mahjoub; Luidi Simonetti; Eduardo Uchoa (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

The k edge-disjoint 3-hop-constrained paths polytope - Fatiha Bendali; I. Diarrassouba; Ali Ridha Mahjoub; Jean Mailfert (Discret. Optim., 2010)

On the complexity of the Eulerian closed walk with precedence path constraints problem - Hervé Kerivin; Mathieu Lacroix; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 2010)

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets - Mathieu Lacroix; Ali Ridha Mahjoub; Sébastien Martin (Electron. Notes Discret. Math., 2010)

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation - Ali Ridha Mahjoub; S. Thomas McCormick (Math. Program., 2010)

A branch-and-cut algorithm for the k-edge connected subgraph problem - Fatiha Bendali; I. Diarrassouba; Ali Ridha Mahjoub; Mohamed Didi Biha; Jean Mailfert (Networks, 2010)

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval - Imed Kacem; Ali Ridha Mahjoub (Comput. Ind. Eng., 2009)

Generating Facets for the Independence System Polytope - Pierre Fouilhoux; Martine Labbé; Ali Ridha Mahjoub; Hande Yaman (SIAM J. Discret. Math., 2009)

On the dominating set polytope - Mustapha Bouchakour; T. M. Contenza; Carl W. Lee; Ali Ridha Mahjoub (Eur. J. Comb., 2008)

On the Steiner 2-edge connected subgraph polytope - Ali Ridha Mahjoub; Pierre Pesneau (RAIRO Oper. Res., 2008)

On the Polytope of the (1, 2)-Survivable Network Design Problem - Mohamed Didi Biha; Hervé Kerivin; Ali Ridha Mahjoub (SIAM J. Discret. Math., 2008)

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut - David Huygens; Martine Labbé; Ali Ridha Mahjoub; Pierre Pesneau (Networks, 2007)

Integer programming formulations for the two 4-hop-constrained paths problem - David Huygens; Ali Ridha Mahjoub (Networks, 2007)

Editorial - Jean François Maurras; Ali Ridha Mahjoub (RAIRO Oper. Res., 2007)

The Maximum Induced Bipartite Subgraph Problem with Edge Weights - Denis Cornaz; Ali Ridha Mahjoub (SIAM J. Discret. Math., 2007)

The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut - Fatiha Bendali; Ibrahima Diarrassouba; Mohamed Didi Biha; Ali Ridha Mahjoub; Jean Mailfert (6th International Workshop on Design and Reliable Communication Networks, DRCN 2007, La Rochelle, France, October 7-10, 2007, 2007)

Design of survivable IP-over-optical networks - Sylvie Borne; Éric Gourdin; Bernard Liau; Ali Ridha Mahjoub (Ann. Oper. Res., 2006)

Polyhedral results for the bipartite induced subgraph problem - Pierre Fouilhoux; Ali Ridha Mahjoub (Discret. Appl. Math., 2006)

On the independent dominating set polytope - Ali Ridha Mahjoub; Jean Mailfert (Eur. J. Comb., 2006)

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

Critical extreme points of the 2-edge connected spanning subgraph polytope - Jean Fonlupt; Ali Ridha Mahjoub (Math. Program., 2006)

On the k edge-disjoint 2-hop-constrained paths polytope - Geir Dahl; David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (Oper. Res. Lett., 2006)

On survivable network polyhedra - Hervé Kerivin; Ali Ridha Mahjoub (Discret. Math., 2005)

Design of Survivable Networks: A survey - Hervé Kerivin; Ali Ridha Mahjoub (Networks, 2005)

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra - David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (SIAM J. Discret. Math., 2004)

(1, 2)-Survivable Networks: Facets and Branch-and-Cut - Hervé Kerivin; Ali Ridha Mahjoub; Charles Nocq (The Sharpest Cut, 2004)

Composition of Graphs and the Triangle-Free Subgraph Polytope - Fatiha Bendali; Ali Ridha Mahjoub; Jean Mailfert (J. Comb. Optim., 2002)

Separation of partition inequalities for the (1, 2)-survivable network design problem - Hervé Kerivin; Ali Ridha Mahjoub (Oper. Res. Lett., 2002)

The Steiner Traveling Salesman Polytope and Related Polyhedra - Mourad Baïou; Ali Ridha Mahjoub (SIAM J. Optim., 2002)

Steiner trees and polyhedra - Mohamed Didi Biha; Hervé Kerivin; Ali Ridha Mahjoub (Discret. Appl. Math., 2001)

Composition of graphs and the triangle free subgraph polytope - Fatiha Bendali; Ali Ridha Mahjoub; Jean Mailfert (Electron. Notes Discret. Math., 2000)

On Steiner 2-edge connected polytopes - Ali Ridha Mahjoub; Pierre Pesneau (Electron. Notes Discret. Math., 2000)

Steiner k-Edge Connected Subgraph Polyhedra - Mohamed Didi Biha; Ali Ridha Mahjoub (J. Comb. Optim., 2000)

Separation of Partition Inequalities - Mourad Baïou; Francisco Barahona; Ali Ridha Mahjoub (Math. Oper. Res., 2000)

On the Linear Relaxation of the 2-node Connected Subgraph Polytope - Ali Ridha Mahjoub; Charles Nocq (Discret. Appl. Math., 1999)

Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope - Jean Fonlupt; Ali Ridha Mahjoub (Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, 1999)

One-node cutsets and the dominating set polytope - Mustapha Bouchakour; Ali Ridha Mahjoub (Discret. Math., 1997)

On perfectly two-edge connected graphs - Ali Ridha Mahjoub (Discret. Math., 1997)

Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs - Mourad Baïou; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1997)

k-edge connected polyhedra on series-parallel graphs - Mohamed Didi Biha; Ali Ridha Mahjoub (Oper. Res. Lett., 1996)

A Min-max Relation for K\(_3\)-covers in Graphs Noncontractible to K\(_5\)e - Ali Ridha Mahjoub (Discret. Appl. Math., 1995)

On two-connected subgraph polytopes - Francisco Barahona; Ali Ridha Mahjoub (Discret. Math., 1995)

Two-edge connected spanning subgraphs and polyhedra - Ali Ridha Mahjoub (Math. Program., 1994)

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra II: Stable Sets - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra III: Graphs with No W\(_4\) Minor - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs - Francisco Barahona; Jean Fonlupt; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions in the bipartite subgraph polytope - Jean Fonlupt; Ali Ridha Mahjoub; J. P. Uhry (Discret. Math., 1992)

On 2-Connected Subgraph Polytopes - Francisco Barahona; Ali Ridha Mahjoub (Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992, 1992)

On a composition of independence systems by circuit identification - Reinhardt Euler; Ali Ridha Mahjoub (J. Comb. Theory B, 1991)

A note on K\(_i\)-perfect graphs - Jason I. Brown; Derek G. Corneil; Ali Ridha Mahjoub (J. Graph Theory, 1990)

Facets of the balanced (acyclic) induced subgraph polytope - Francisco Barahona; Ali Ridha Mahjoub (Math. Program., 1989)

Book reviews - Diethard Pallaschke; Ali Ridha Mahjoub; Ulrich Faigle; A. Rocinski; Jean-Pierre Crouzeix (ZOR Methods Model. Oper. Res., 1988)

On the stable set polytope of a series-parallel graph - Ali Ridha Mahjoub (Math. Program., 1988)

K\(_i\)-covers. II. K\(_i\)-perfect graphs - Michele Conforti; Derek Gordon Corneil; Ali Ridha Mahjoub (J. Graph Theory, 1987)

K\(_i\)-covers I: Complexity and polytopes - Michele Conforti; Derek G. Corneil; Ali Ridha Mahjoub (Discret. Math., 1986)

On the cut polytope - Francisco Barahona; Ali Ridha Mahjoub (Math. Program., 1986)

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

Facets of the Bipartite Subgraph Polytope - Francisco Barahona; Martin Grötschel; Ali Ridha Mahjoub (Math. Oper. Res., 1985)

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) - Ali Ridha Mahjoub (Grenoble Institute of Technology, France, 1981)