Ali Ridha Mahjoub

发表

Compositions in the bipartite subgraph polytope

Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry, 1992, Discret. Math..

Integer programming formulations for the two 4-hop-constrained paths problem

Ali Ridha Mahjoub, David Huygens, 2007, Networks.

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints

Ali Ridha Mahjoub, Hassene Aissi, 2020, ISCO.

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2015, Mathematical Programming.

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

Ali Ridha Mahjoub, S. Thomas McCormick, Bernard Fortz, 2006, Math. Program..

(1,2)-Survivable Networks: Facets and Branch&Cut

Ali Ridha Mahjoub, Hervé Kerivin, Charles Nocq, 2004 .

On Steiner 2-edge connected polytopes

Ali Ridha Mahjoub, Pierre Pesneau, 2000, Electron. Notes Discret. Math..

A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems

Ali Ridha Mahjoub, Nancy Perrot, M. Yassine Naghmouchi, 2018, Electron. Notes Discret. Math..

A Min-max Relation for K3-covers in Graphs Noncontractible to K5e

Ali Ridha Mahjoub, 1995, Discret. Appl. Math..

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints

Ali Ridha Mahjoub, Raouia Taktak, Sylvie Borne, 2013, Electron. Notes Discret. Math..

Optimization algorithms for the disjunctively constrained knapsack problem

Hanêne Ben-Abdallah, Ali Ridha Mahjoub, Raouia Taktak, 2018, Soft Comput..

The k-node-connected subgraph problem: Facets and Branch-and-Cut

Ali Ridha Mahjoub, I. Diarrassouba, Meriem Mahjoub, 2016, 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN).

Composition of graphs and the triangle free subgraph polytope

Ali Ridha Mahjoub, Fatiha Bendali, Jean Mailfert, 2000, Electron. Notes Discret. Math..

Ki-covers. II. Ki-perfect graphs

Ali Ridha Mahjoub, Michele Conforti, Derek G. Corneil, 1987, J. Graph Theory.

Facets of the Bipartite Subgraph Polytope

Martin Grötschel, Ali Ridha Mahjoub, Francisco Barahona, 1985, Math. Oper. Res..

On the independent dominating set polytope

Ali Ridha Mahjoub, Jean Mailfert, A. Mahjoub, 2006, Eur. J. Comb..

(1, 2)-Survivable Networks: Facets and Branch-and-Cut

Ali Ridha Mahjoub, Hervé Kerivin, Charles Nocq, 2004, The Sharpest Cut.

Randomized Contractions for Multiobjective Minimum Cuts

R. Ravi, Ali Ridha Mahjoub, Hassene Aissi, 2017, ESA.

Two-edge connected spanning subgraphs and polyhedra

Ali Ridha Mahjoub, A. Mahjoub, 1994, Math. Program..

Separation of partition inequalities for the (1, 2)-survivable network design problem

Ali Ridha Mahjoub, Hervé Kerivin, A. Mahjoub, 2002, Oper. Res. Lett..

Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Polyhedral analysis for the disjunctively constrained Knapsack Problem

Hanêne Ben-Abdallah, Ali Ridha Mahjoub, Raouia Taktak, 2016, 2016 International Conference on Control, Decision and Information Technologies (CoDIT).

On 2-Connected Subgraph Polytopes

Ali Ridha Mahjoub, Francisco Barahona, 1992, IPCO.

Minimal arc-sets spanning dicycles

Ali Ridha Mahjoub, Denis Cornaz, Hervé Kerivin, 2018, Discret. Appl. Math..

Critical extreme points of the 2-edge connected spanning subgraph polytope

Jean Fonlupt, Ali Ridha Mahjoub, J. Fonlupt, 1999, Math. Program..

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

Ali Ridha Mahjoub, David Huygens, Pierre Pesneau, 2005, SIAM J. Discret. Math..

Preface

Ali Ridha Mahjoub, Nelson Maculan, Eduardo Uchoa, 2014, RAIRO Oper. Res..

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets

Ali Ridha Mahjoub, Mathieu Lacroix, Sébastien Martin, 2010, Electron. Notes Discret. Math..

On the NP-completeness of the perfect matching free subgraph problem

Ali Ridha Mahjoub, Christophe Picouleau, Mathieu Lacroix, 2012, Theor. Comput. Sci..

The multi-terminal vertex separator problem: Branch-and-Cut-and-Price

Ali Ridha Mahjoub, Sébastien Martin, Youcef Magnouche, 2021, Discret. Appl. Math..

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016

Franz Rendl, Ali Ridha Mahjoub, Satoru Fujishige, 2019, J. Comb. Optim..

Models for the single-vehicle preemptive pickup and delivery problem

Ali Ridha Mahjoub, Mathieu Lacroix, Hervé Kerivin, 2010, Journal of Combinatorial Optimization.

Polyhedral results for the bipartite induced subgraph problem

Ali Ridha Mahjoub, Pierre Fouilhoux, 2006, Discret. Appl. Math..

Hose workload based exact algorithm for the optimal design of virtual private networks

Ali Ridha Mahjoub, Habib Youssef, I. Diarrassouba, 2013, Comput. Networks.

The Steiner Traveling Salesman Polytope and Related Polyhedra

Ali Ridha Mahjoub, Mourad Baïou, Mourad Baïou, 2002, SIAM J. Optim..

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra

Ali Ridha Mahjoub, I. Diarrassouba, Hakan Kutucu, 2013, Electron. Notes Discret. Math..

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut

Ali Ridha Mahjoub, Denis Cornaz, Sébastien Martin, 2019, Discret. Appl. Math..

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut

Ali Ridha Mahjoub, Raouia Taktak, I. Diarrassouba, 2017, Comput. Ind. Eng..

On the Polytope of the (1, 2)-Survivable Network Design Problem

Ali Ridha Mahjoub, Mohamed Didi Biha, Hervé Kerivin, 2008, SIAM J. Discret. Math..

A parallel hybrid optimization algorithm for some network design problems

Ali Ridha Mahjoub, I. Diarrassouba, Mohamed Khalil Labidi, 2019, Soft Comput..

Simulated evolution based algorithm versus exact method for virtual private network design

Ali Ridha Mahjoub, Habib Youssef, Aref Meddeb, 2014, 2014 10th International Conference on Natural Computation (ICNC).

Survivability in Hierarchical Telecommunications Networks Under Dual Homing

Ali Ridha Mahjoub, Hande Yaman, Oya Ekin Karasan, 2014, INFORMS J. Comput..

Design of survivable IP-over-optical networks

Ali Ridha Mahjoub, Sylvie Borne, Éric Gourdin, 2006, Ann. Oper. Res..

Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut

Ali Ridha Mahjoub, Martine Labbé, David Huygens, 2005 .

On survivable network polyhedra

Ali Ridha Mahjoub, Hervé Kerivin, A. Mahjoub, 2005, Discret. Math..

Facets of the balanced (acyclic) induced subgraph polytope

Ali Ridha Mahjoub, Francisco Barahona, 1989, Math. Program..

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem

Ali Ridha Mahjoub, Luís Gouveia, Virginie Gabrel, 2016, Networks.

Composition of Graphs and the Triangle-Free Subgraph Polytope

Ali Ridha Mahjoub, Fatiha Bendali, Jean Mailfert, 2002, J. Comb. Optim..

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2014, IPCO.

Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope

Jean Fonlupt, Ali Ridha Mahjoub, 1999, IPCO.

On the Linear Relaxation of the 2-node Connected Subgraph Polytope

Ali Ridha Mahjoub, Charles Nocq, A. Mahjoub, 1999, Discret. Appl. Math..

The Maximum Induced Bipartite Subgraph Problem with Edge Weights

Ali Ridha Mahjoub, Denis Cornaz, A. Mahjoub, 2007, SIAM J. Discret. Math..

Combinatorial Optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers

Vangelis Th. Paschos, Ali Ridha Mahjoub, Ioannis Milis, 2012 .

Unsplittable non-additive capacitated network design using set functions polyhedra

Ali Ridha Mahjoub, Amal Benhamiche, Nancy Perrot, 2016, Comput. Oper. Res..

Balanced matrices and the set covering problem

Ali Ridha Mahjoub, Reinhardt Euler, 1991 .

Steiner k-Edge Connected Subgraph Polyhedra

Ali Ridha Mahjoub, Mohamed Didi Biha, A. Mahjoub, 2000, J. Comb. Optim..

Assessing the risk of complex ICT systems

Ali Ridha Mahjoub, Nizar Kheir, Nancy Perrot, 2017, Annals of Telecommunications.

A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem

Ali Ridha Mahjoub, I. Diarrassouba, Mohamed Khalil Labidi, 2016, GECCO.

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP

Ali Ridha Mahjoub, Alain Quilliot, Pierre Fouilhoux, 2018, RAIRO Oper. Res..

On the complexity of the Eulerian closed walk with precedence path constraints problem

Ali Ridha Mahjoub, Mathieu Lacroix, Hervé Kerivin, 2012, Theor. Comput. Sci..

Two node-disjoint hop-constrained survivable network design and polyhedra

Ali Ridha Mahjoub, I. Diarrassouba, Hakan Kutucu, 2016, Networks.

Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models

Ali Ridha Mahjoub, Habib Youssef, Aref Meddeb, 2011, 2011 Seventh International Conference on Natural Computation.

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut

Ali Ridha Mahjoub, Raouia Taktak, I. Diarrassouba, 2016, Electron. Notes Discret. Math..

The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut

Ali Ridha Mahjoub, I. Diarrassouba, Pedro Henrique P. V. Liguori, 2018, Electron. Notes Discret. Math..

Preface

Ali Ridha Mahjoub, Luís Gouveia, Andrea Lodi, 2016, Discret. Optim..

The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut

Ali Ridha Mahjoub, Pierre Fouilhoux, Oya Ekin-Karazan, 2009 .

On the cut polytope

Ali Ridha Mahjoub, Francisco Barahona, F. Barahona, 1986, Math. Program..

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem

Ali Ridha Mahjoub, Sylvie Borne, Éric Gourdin, 2018, Comput. Ind. Eng..

Book reviews

Ali Ridha Mahjoub, Ulrich Faigle, Jean-Pierre Crouzeix, 1988, ZOR Methods Model. Oper. Res..

On a composition of independence systems by circuit identification

Ali Ridha Mahjoub, Reinhardt Euler, 1991, J. Comb. Theory, Ser. B.

On minimal two-edge-connected graphs

Ali Ridha Mahjoub, Denis Cornaz, Youcef Magnouche, 2014, 2014 International Conference on Control, Decision and Information Technologies (CoDIT).

On perfectly two-edge connected graphs

Ali Ridha Mahjoub, A. Mahjoub, 1997, Discret. Math..

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Ali Ridha Mahjoub, Imed Kacem, 2009, Comput. Ind. Eng..

Survivability in hierarchical telecommunications networks

Ali Ridha Mahjoub, Hande Yaman, Oya Ekin Karasan, 2012, Networks.

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, 1981 .

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Preface

Ali Ridha Mahjoub, Dominique de Werra, Nelson Maculan, 2014, Discret. Appl. Math..

Separation of Partition Inequalities

Ali Ridha Mahjoub, Francisco Barahona, Mourad Baïou, 2000, Math. Oper. Res..

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems

Ali Ridha Mahjoub, Mathieu Lacroix, Sébastien Martin, 2011, Comput. Ind. Eng..

Techniques de flots et comparaison d'images en 2D

Ali Ridha Mahjoub, Moncef Daoud, Michael Tanguy, 1997 .

A note on Ki-perfect graphs

Ali Ridha Mahjoub, Jason I. Brown, Derek G. Corneil, 1990, J. Graph Theory.

The vertex k-cut problem

Ali Ridha Mahjoub, Fabio Furini, Mathieu Lacroix, 2019, Discret. Optim..

Design of Survivable Networks: A survey

Ali Ridha Mahjoub, Hervé Kerivin, A. Mahjoub, 2005, Networks.

A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem

Ali Ridha Mahjoub, I. Diarrassouba, Mohamed Khalil Labidi, 2018, Electron. Notes Discret. Math..

On the Design of Optical OFDM-Based Networks

Ali Ridha Mahjoub, Amal Benhamiche, Nancy Perrot, 2011, INOC.

On the complexity of the Eulerian closed walk with precedence path constraints problem

Ali Ridha Mahjoub, Mathieu Lacroix, Hervé Kerivin, 2010, Electron. Notes Discret. Math..

On the dominating set polytope

Ali Ridha Mahjoub, Carl W. Lee, Mustapha Bouchakour, 2008, Eur. J. Comb..

Editorial

Ali Ridha Mahjoub, Jean François Maurras, 2007, RAIRO Oper. Res..

Ki-covers I: Complexity and polytopes

Ali Ridha Mahjoub, Derek G. Corneil, M Conforti, 1986, Discret. Math..

One-node cutsets and the dominating set polytope

Ali Ridha Mahjoub, Mustapha Bouchakour, A. Mahjoub, 1997, Discret. Math..

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

Ali Ridha Mahjoub, S. Thomas McCormick, A. Mahjoub, 2010, Math. Program..

The k edge-disjoint 3-hop-constrained paths polytope

Ali Ridha Mahjoub, Fatiha Bendali, Jean Mailfert, 2010, Discret. Optim..

Distance Transformation for Network Design Problems

Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, 2019, SIAM J. Optim..

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem

Ali Ridha Mahjoub, Mathieu Lacroix, Sébastien Martin, 2012, ISCO.

Compositions of Graphs and Polyhedra II: Stable Sets

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem

Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa, 2011, INOC.

Solving VLSI design and DNA sequencing problems using bipartization of graphs

Ali Ridha Mahjoub, Pierre Fouilhoux, A. Mahjoub, 2012, Comput. Optim. Appl..

Generating Facets for the Independence System Polytope

Ali Ridha Mahjoub, Martine Labbé, Hande Yaman, 2009, SIAM J. Discret. Math..

On the star forest polytope for trees and cycles

Ali Ridha Mahjoub, Viet Hung Nguyen, Mourad Baïou, 2019, RAIRO Oper. Res..

On two-connected subgraph polytopes

Ali Ridha Mahjoub, Francisco Barahona, F. Barahona, 1995, Discret. Math..

Multilayer Survivable Optical Network Design

Ali Ridha Mahjoub, Raouia Taktak, Virginie Gabrel, 2011, INOC.

Mathematical formulations for the Balanced Vertex k-Separator Problem

Ali Ridha Mahjoub, Fabio Furini, Mathieu Lacroix, 2014, 2014 International Conference on Control, Decision and Information Technologies (CoDIT).

The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut

Ali Ridha Mahjoub, Martine Labbé, David Huygens, 2007, Networks.

Steiner trees and polyhedra

Ali Ridha Mahjoub, Mohamed Didi Biha, Hervé Kerivin, 2001, Discret. Appl. Math..

On the star forest polytope

Ali Ridha Mahjoub, Viet Hung Nguyen, Méziane Aïder, 2014, 2014 International Conference on Control, Decision and Information Technologies (CoDIT).

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

Ali Ridha Mahjoub, Hande Yaman, I. Diarrassouba, 2018, Ann. des Télécommunications.

É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 .

Progress in combinatorial optimization

Ali Ridha Mahjoub, 2011 .

A special case of Variable-Sized Bin Packing Problem with Color Constraints

Ali Ridha Mahjoub, Raouia Taktak, Saïd Hanafi, 2019, 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT).

The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price

Ali Ridha Mahjoub, Sébastien Martin, Youcef Magnouche, 2016, 2016 International Conference on Control, Decision and Information Technologies (CoDIT).

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs

Jean Fonlupt, Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

A branch‐and‐cut algorithm for the k‐edge connected subgraph problem

Ali Ridha Mahjoub, Fatiha Bendali, Jean Mailfert, 2010, Networks.

Preface: Combinatorial Optimization ISCO 2018

Giovanni Rinaldi, Ali Ridha Mahjoub, Jon Lee, 2022, Discrete Applied Mathematics.

Preface: New trends on combinatorial optimization for network and logistical applications

Hans Kellerer, Ali Ridha Mahjoub, Imed Kacem, 2021, Annals of Operations Research.

An exact model for multi-layer constrained via minimization

Ali Ridha Mahjoub, Pierre Fouilhoux, Laboratoire Limos-Cnrs Umr, 2004 .

Critical extreme points of the 2-edge connected subgraph polytope

Jean Fonlupt, Ali Ridha Mahjoub, 2006 .

The Maximum Cut Problem

Ali Ridha Mahjoub, Walid Ben‐Ameur, A. Mahjoub, 2014 .

A branch-and-cut algorithm for the k-edge connected subgraph problem

Ali Ridha Mahjoub, Fatiha Bendali, I. Diarrassouba, 2010 .

The k-edge- connected subgraph problem I: Polytopes and critical extreme points

Ali Ridha Mahjoub, M. Didi Biha, 2004 .