Ali Ridha Mahjoub

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 42

Top Venues

CoDIT

Discret. Appl. Math.

Electron. Notes Discret. Math.

RAIRO Oper. Res.

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Hassene Aissi, Ali Ridha Mahjoub
On the minimum s-t cut problem with budget constraints. Math. Program. 203 (1) (2024)
Intesar M. Al-Mudahka, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut. Comput. Ind. Eng. 184 (2023)
Isma Bentoumi, Fabio Furini, Ali Ridha Mahjoub, Sébastien Martin
A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CoDIT (2023)
Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub
The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm. CoDIT (2022)
Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi
Preface: Combinatorial Optimization ISCO 2018. Discret. Appl. Math. 308 (2022)
Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298 (1) (2021)
Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. Discret. Appl. Math. 290 (2021)
Hassene Aissi, Ali Ridha Mahjoub
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. ISCO (2020)
Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24 (23) (2020)
Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. Discret. Optim. 35 (2020)
Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub
A parallel hybrid optimization algorithm for some network design problems. Soft Comput. 23 (6) (2019)
Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen
On the star forest polytope for trees and cycles. RAIRO Oper. Res. 53 (5) (2019)
Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa
Distance Transformation for Network Design Problems. SIAM J. Optim. 29 (2) (2019)
Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman
A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing. Transp. Sci. 53 (4) (2019)
Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut
A special case of Variable-Sized Bin Packing Problem with Color Constraints. CoDIT (2019)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
The vertex k-cut problem. Discret. Optim. 31 (2019)
Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. 37 (1) (2019)
Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa
A layered compact formulation for the Multiple Steiner TSP with Order constraints. CoDIT (2019)
Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. Discret. Appl. Math. 256 (2019)
Pierre Fouilhoux, Ali Ridha Mahjoub, Alain Quilliot, Hélène Toussaint
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP. RAIRO Oper. Res. 52 (2) (2018)
Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub
-Connected Network Design Problem. Electron. Notes Discret. Math. 64 (2018)
Ali Ridha Mahjoub, M. Yassine Naghmouchi, Nancy Perrot
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems. Electron. Notes Discret. Math. 64 (2018)
Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub
Minimal arc-sets spanning dicycles. Discret. Appl. Math. 240 (2018)
Sylvie Borne, Éric Gourdin, Olivier Klopfenstein, Ali Ridha Mahjoub
A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem. Comput. Ind. Eng. 124 (2018)
Nizar Kheir, Ali Ridha Mahjoub, M. Yassine Naghmouchi, Nancy Perrot, Jean-Philippe Wary
Assessing the risk of complex ICT systems. Ann. des Télécommunications 73 (1-2) (2018)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut. Ann. des Télécommunications 73 (1-2) (2018)
Ibrahima Diarrassouba, Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut. Electron. Notes Discret. Math. 64 (2018)
Mariem Ben Salem, Raouia Taktak, Ali Ridha Mahjoub, Hanêne Ben-Abdallah
Optimization algorithms for the disjunctively constrained knapsack problem. Soft Comput. 22 (6) (2018)
Hassene Aissi, Ali Ridha Mahjoub, R. Ravi
Randomized Contractions for Multiobjective Minimum Cuts. ESA (2017)
Meriem Mahjoub, I. Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak
The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut. Comput. Ind. Eng. 112 (2017)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub
The k-node-connected subgraph problem: Facets and Branch-and-Cut. DRCN (2016)
Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price. CoDIT (2016)
M. Yassine Naghmouchi, Nancy Perrot, Nizar Kheir, Ali Ridha Mahjoub, Jean-Philippe Wary
A New Risk Assessment Framework Using Graph Theory for Complex ICT Systems. MIST@CCS (2016)
Mariem Ben Salem, Raouia Taktak, Hanêne Ben-Abdallah, Ali Ridha Mahjoub
Polyhedral analysis for the disjunctively constrained Knapsack Problem. CoDIT (2016)
Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67 (4) (2016)
Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub
Preface. Discret. Optim. 22 (2016)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut. Electron. Notes Discret. Math. 52 (2016)
Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa
Unsplittable non-additive capacitated network design using set functions polyhedra. Comput. Oper. Res. 66 (2016)
Mohamed Khalil Labidi, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Anissa Omrane
A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem. GECCO (2016)
I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau
-edge-connected 3-hop-constrained network design problem. Networks 67 (2) (2016)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154 (1-2) (2015)
Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger
Preface. Math. Program. 150 (1) (2015)
Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub
On minimal two-edge-connected graphs. CoDIT (2014)
Boulbaba Thabti, Habib Youssef, Ali Ridha Mahjoub, Aref Meddeb
Simulated evolution based algorithm versus exact method for virtual private network design. ICNC (2014)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT (2014)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO (2014)
Dominique de Werra, Nelson Maculan, Ali Ridha Mahjoub
Preface. Discret. Appl. Math. 164 (2014)
Nelson Maculan, Ali Ridha Mahjoub, Eduardo Uchoa
Preface. RAIRO Oper. Res. 48 (2) (2014)
Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. INFORMS J. Comput. 26 (1) (2014)
Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder
On the star forest polytope. CoDIT (2014)
Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa
Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61 (2) (2013)
Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak
A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. Electron. Notes Discret. Math. 41 (2013)
Ibrahima Diarrassouba, Ali Lourimi, Ali Ridha Mahjoub, Habib Youssef
Hose workload based exact algorithm for the optimal design of virtual private networks. Comput. Networks 57 (14) (2013)
Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa
Capacitated Network Design using Bin-Packing. Electron. Notes Discret. Math. 41 (2013)
Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. Electron. Notes Discret. Math. 41 (2013)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
On the complexity of the Eulerian closed walk with precedence path constraints problem. Theor. Comput. Sci. 439 (2012)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO (2012)
Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
Survivability in hierarchical telecommunications networks. Networks 59 (1) (2012)
Pierre Fouilhoux, Ali Ridha Mahjoub
Solving VLSI design and DNA sequencing problems using bipartization of graphs. Comput. Optim. Appl. 51 (2) (2012)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23 (2) (2012)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423 (2012)
Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. INOC (2011)
Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak
Multilayer Survivable Optical Network Design. INOC (2011)
Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot
On the Design of Optical OFDM-Based Networks. INOC (2011)
Boulbaba Thabti, Habib Youssef, Aref Meddeb, Ali Ridha Mahjoub
Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models. ICNC (2011)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. Comput. Ind. Eng. 61 (2) (2011)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. Electron. Notes Discret. Math. 36 (2010)
Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert
-edge connected subgraph problem. Networks 55 (1) (2010)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
On the complexity of the Eulerian closed walk with precedence path constraints problem. Electron. Notes Discret. Math. 36 (2010)
Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert
The k edge-disjoint 3-hop-constrained paths polytope. Discret. Optim. 7 (4) (2010)
Ali Ridha Mahjoub, S. Thomas McCormick
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124 (1-2) (2010)
Imed Kacem, Ali Ridha Mahjoub
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng. 56 (4) (2009)
Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23 (3) (2009)
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
On the Polytope of the (1, 2)-Survivable Network Design Problem. SIAM J. Discret. Math. 22 (4) (2008)
Mustapha Bouchakour, T. M. Contenza, Carl W. Lee, Ali Ridha Mahjoub
On the dominating set polytope. Eur. J. Comb. 29 (3) (2008)
Denis Cornaz, Ali Ridha Mahjoub
The Maximum Induced Bipartite Subgraph Problem with Edge Weights. SIAM J. Discret. Math. 21 (3) (2007)
David Huygens, Ali Ridha Mahjoub
Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49 (2) (2007)
David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks 49 (1) (2007)
Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. DRCN (2007)
Jean François Maurras, Ali Ridha Mahjoub
Editorial. RAIRO Oper. Res. 41 (3) (2007)
Ali Ridha Mahjoub, Jean Mailfert
On the independent dominating set polytope. Eur. J. Comb. 27 (4) (2006)
Pierre Fouilhoux, Ali Ridha Mahjoub
Polyhedral results for the bipartite induced subgraph problem. Discret. Appl. Math. 154 (15) (2006)
Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34 (5) (2006)
Jean Fonlupt, Ali Ridha Mahjoub
Critical extreme points of the 2-edge connected spanning subgraph polytope. Math. Program. 105 (2-3) (2006)
Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub
Design of survivable IP-over-optical networks. Ann. Oper. Res. 146 (1) (2006)
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105 (1) (2006)
Hervé Kerivin, Ali Ridha Mahjoub
On survivable network polyhedra. Discret. Math. 290 (2/3) (2005)
Hervé Kerivin, Ali Ridha Mahjoub
Design of Survivable Networks: A survey. Networks 46 (1) (2005)
David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. SIAM J. Discret. Math. 18 (2) (2004)
Mourad Baïou, Ali Ridha Mahjoub
The Steiner Traveling Salesman Polytope and Related Polyhedra. SIAM J. Optim. 13 (2) (2002)
Hervé Kerivin, Ali Ridha Mahjoub
Separation of partition inequalities for the (1, 2)-survivable network design problem. Oper. Res. Lett. 30 (4) (2002)
Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert
Composition of Graphs and the Triangle-Free Subgraph Polytope. J. Comb. Optim. 6 (4) (2002)
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
Steiner trees and polyhedra. Discret. Appl. Math. 112 (1-3) (2001)
Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert
Composition of graphs and the triangle free subgraph polytope. Electron. Notes Discret. Math. 5 (2000)
Mohamed Didi Biha, Ali Ridha Mahjoub
Steiner k-Edge Connected Subgraph Polyhedra. J. Comb. Optim. 4 (1) (2000)
Ali Ridha Mahjoub, Pierre Pesneau
On Steiner 2-edge connected polytopes. Electron. Notes Discret. Math. 5 (2000)
Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
Separation of Partition Inequalities. Math. Oper. Res. 25 (2) (2000)
Ali Ridha Mahjoub, Charles Nocq
On the Linear Relaxation of the 2-node Connected Subgraph Polytope. Discret. Appl. Math. 95 (1-3) (1999)
Jean Fonlupt, Ali Ridha Mahjoub
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. IPCO (1999)
Mourad Baïou, Ali Ridha Mahjoub
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. SIAM J. Discret. Math. 10 (3) (1997)

Ali Ridha Mahjoub.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ali Ridha Mahjoub