default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Ridha Mahjoub
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j102]Fatmah Almathkour
, Youcef Magnouche, Ali Ridha Mahjoub, Raouia Taktak:
Design of survivable networks with low connectivity requirements. Int. Trans. Oper. Res. 32(2): 918-960 (2025)- 2024
- [j101]Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub:
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem. J. Comb. Optim. 47(4): 56 (2024) - [j100]Hassene Aissi, Ali Ridha Mahjoub:
On the minimum s-t cut problem with budget constraints. Math. Program. 203(1): 421-442 (2024) - [j99]I. Diarrassouba, Ali Ridha Mahjoub, Intesar M. Al-Mudahka:
Optimization algorithms for the k edge-connected L-hop-constrained network design problem. Soft Comput. 28(11-12): 7201-7225 (2024) - [e7]Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González:
Combinatorial Optimization - 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14594, Springer 2024, ISBN 978-3-031-60923-7 [contents] - 2023
- [j98]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: 109585 (2023) - [j97]Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub, Guillaume Marquès, Ruslan Sadykov, Eduardo Uchoa:
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems. Oper. Res. 71(5): 1577-1595 (2023) - [c24]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: 674-677 - 2022
- [j96]Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi:
Preface: Combinatorial Optimization ISCO 2018. Discret. Appl. Math. 308: 1-3 (2022) - [c23]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: 926-931 - [e6]Ivana Ljubic, Francisco Barahona, Santanu S. Dey, Ali Ridha Mahjoub:
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13526, Springer 2022, ISBN 978-3-031-18529-8 [contents] - 2021
- [j95]Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub:
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298(1): 1-5 (2021) - [j94]Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. Discret. Appl. Math. 290: 86-111 (2021) - 2020
- [j93]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: 100555 (2020) - [j92]Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24(23): 17957-17968 (2020) - [c22]Hassene Aissi, Ali Ridha Mahjoub:
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. ISCO 2020: 81-88 - [e5]Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub:
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents]
2010 – 2019
- 2019
- [j91]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: 11-37 (2019) - [j90]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j89]Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl:
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. 37(1): 418-422 (2019) - [j88]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): 1763-1773 (2019) - [j87]Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa:
Distance Transformation for Network Design Problems. SIAM J. Optim. 29(2): 1687-1713 (2019) - [j86]Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub:
A parallel hybrid optimization algorithm for some network design problems. Soft Comput. 23(6): 1947-1964 (2019) - [j85]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): 1107-1125 (2019) - [c21]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: 1150-1154 - [c20]Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
A layered compact formulation for the Multiple Steiner TSP with Order constraints. CoDIT 2019: 1462-1467 - 2018
- [j84]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): 5-28 (2018) - [j83]Nizar Kheir, Ali Ridha Mahjoub, Mohamed Yassine Naghmouchi, Nancy Perrot, Jean-Philippe Wary:
Assessing the risk of complex ICT systems. Ann. des Télécommunications 73(1-2): 95-109 (2018) - [j82]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: 582-603 (2018) - [j81]Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub:
Minimal arc-sets spanning dicycles. Discret. Appl. Math. 240: 33-43 (2018) - [j80]Ali Ridha Mahjoub, Mohamed Yassine Naghmouchi, Nancy Perrot:
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems. Electron. Notes Discret. Math. 64: 295-304 (2018) - [j79]Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub:
A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem. Electron. Notes Discret. Math. 64: 305-314 (2018) - [j78]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: 315-324 (2018) - [j77]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): 513 (2018) - [j76]Mariem Ben Salem, Raouia Taktak, Ali Ridha Mahjoub, Hanêne Ben-Abdallah:
Optimization algorithms for the disjunctively constrained knapsack problem. Soft Comput. 22(6): 2025-2043 (2018) - [e4]Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub:
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10856, Springer 2018, ISBN 978-3-319-96150-7 [contents] - 2017
- [j75]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: 690-705 (2017) - [c19]Hassene Aissi, Ali Ridha Mahjoub, R. Ravi:
Randomized Contractions for Multiobjective Minimum Cuts. ESA 2017: 6:1-6:13 - 2016
- [j74]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Unsplittable non-additive capacitated network design using set functions polyhedra. Comput. Oper. Res. 66: 105-115 (2016) - [j73]Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub:
Preface. Discret. Optim. 22: 1-5 (2016) - [j72]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: 117-124 (2016) - [j71]I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (2016) - [j70]Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub:
Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67(4): 316-337 (2016) - [c18]Mohamed 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: 97-100 - [c17]Mariem Ben Salem, Raouia Taktak, Hanêne Ben-Abdallah, Ali Ridha Mahjoub:
Polyhedral analysis for the disjunctively constrained Knapsack Problem. CoDIT 2016: 557-562 - [c16]Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price. CoDIT 2016: 683-688 - [c15]Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub:
The k-node-connected subgraph problem: Facets and Branch-and-Cut. DRCN 2016: 1-8 - [c14]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: 685-692 - [e3]Raffaele Cerulli, Satoru Fujishige, Ali Ridha Mahjoub:
Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9849, Springer 2016, ISBN 978-3-319-45586-0 [contents] - 2015
- [j69]Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger:
Preface. Math. Program. 150(1): 1-3 (2015) - [j68]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): 3-28 (2015) - 2014
- [j67]Dominique de Werra, Nelson Maculan, Ali Ridha Mahjoub:
Preface. Discret. Appl. Math. 164: 1 (2014) - [j66]Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. INFORMS J. Comput. 26(1): 1-15 (2014) - [j65]Nelson Maculan, Ali Ridha Mahjoub, Eduardo Uchoa:
Preface. RAIRO Oper. Res. 48(2): 151-152 (2014) - [c13]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: 176-181 - [c12]Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub:
On minimal two-edge-connected graphs. CoDIT 2014: 251-256 - [c11]Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder:
On the star forest polytope. CoDIT 2014: 263-268 - [c10]Boulbaba Thabti, Habib Youssef, Ali Ridha Mahjoub, Aref Meddeb:
Simulated evolution based algorithm versus exact method for virtual private network design. ICNC 2014: 245-249 - [c9]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO 2014: 25-36 - [e2]Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos:
Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8596, Springer 2014, ISBN 978-3-319-09173-0 [contents] - 2013
- [j64]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): 2766-2774 (2013) - [j63]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Network Design using Bin-Packing. Electron. Notes Discret. Math. 41: 479-486 (2013) - [j62]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: 487-494 (2013) - [j61]Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub:
Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. Electron. Notes Discret. Math. 41: 551-558 (2013) - [j60]Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2): 171-179 (2013) - 2012
- [j59]Pierre Fouilhoux, Ali Ridha Mahjoub:
Solving VLSI design and DNA sequencing problems using bipartization of graphs. Comput. Optim. Appl. 51(2): 749-781 (2012) - [j58]Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23(2): 196-223 (2012) - [j57]Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in hierarchical telecommunications networks. Networks 59(1): 37-58 (2012) - [j56]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: 25-29 (2012) - [j55]Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem. Theor. Comput. Sci. 439: 16-29 (2012) - [c8]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO 2012: 117-128 - [e1]Ali 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. Lecture Notes in Computer Science 7422, Springer 2012, ISBN 978-3-642-32146-7 [contents] - 2011
- [j54]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): 422-429 (2011) - [c7]Boulbaba Thabti, Habib Youssef, Aref Meddeb, Ali Ridha Mahjoub:
Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models. ICNC 2011: 2058-2064 - [c6]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot:
On the Design of Optical OFDM-Based Networks. INOC 2011: 1-6 - [c5]Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak:
Multilayer Survivable Optical Network Design. INOC 2011: 170-175 - [c4]Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. INOC 2011: 176-181 - 2010
- [j53]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert:
The k edge-disjoint 3-hop-constrained paths polytope. Discret. Optim. 7(4): 222-233 (2010) - [j52]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: 899-906 (2010) - [j51]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. Electron. Notes Discret. Math. 36: 1073-1080 (2010) - [j50]Ali Ridha Mahjoub, S. Thomas McCormick:
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1-2): 271-284 (2010) - [j49]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1): 13-32 (2010)
2000 – 2009
- 2009
- [j48]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): 1708-1712 (2009) - [j47]Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman:
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23(3): 1484-1506 (2009) - 2008
- [j46]Mustapha Bouchakour, T. M. Contenza, Carl W. Lee, Ali Ridha Mahjoub:
On the dominating set polytope. Eur. J. Comb. 29(3): 652-661 (2008) - [j45]Ali Ridha Mahjoub, Pierre Pesneau:
On the Steiner 2-edge connected subgraph polytope. RAIRO Oper. Res. 42(3): 259-283 (2008) - [j44]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): 1640-1666 (2008) - 2007
- [j43]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): 116-133 (2007) - [j42]David Huygens, Ali Ridha Mahjoub:
Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49(2): 135-144 (2007) - [j41]Jean François Maurras, Ali Ridha Mahjoub:
Editorial. RAIRO Oper. Res. 41(3): 231-233 (2007) - [j40]Denis Cornaz, Ali Ridha Mahjoub:
The Maximum Induced Bipartite Subgraph Problem with Edge Weights. SIAM J. Discret. Math. 21(3): 662-675 (2007) - [c3]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: 1-8 - 2006
- [j39]Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub:
Design of survivable IP-over-optical networks. Ann. Oper. Res. 146(1): 41-73 (2006) - [j38]Pierre Fouilhoux, Ali Ridha Mahjoub:
Polyhedral results for the bipartite induced subgraph problem. Discret. Appl. Math. 154(15): 2128-2149 (2006) - [j37]Ali Ridha Mahjoub, Jean Mailfert:
On the independent dominating set polytope. Eur. J. Comb. 27(4): 601-616 (2006) - [j36]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): 85-111 (2006) - [j35]Jean Fonlupt, Ali Ridha Mahjoub:
Critical extreme points of the 2-edge connected spanning subgraph polytope. Math. Program. 105(2-3): 289-310 (2006) - [j34]Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006) - 2005
- [j33]Hervé Kerivin, Ali Ridha Mahjoub:
On survivable network polyhedra. Discret. Math. 290(2/3): 183-210 (2005) - [j32]Hervé Kerivin, Ali Ridha Mahjoub:
Design of Survivable Networks: A survey. Networks 46(1): 1-21 (2005) - 2004
- [j31]David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. SIAM J. Discret. Math. 18(2): 287-312 (2004) - [p1]Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq:
(1, 2)-Survivable Networks: Facets and Branch-and-Cut. The Sharpest Cut 2004: 121-152 - 2002
- [j30]Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of Graphs and the Triangle-Free Subgraph Polytope. J. Comb. Optim. 6(4): 359-381 (2002) - [j29]Hervé Kerivin, Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem. Oper. Res. Lett. 30(4): 265-268 (2002) - [j28]Mourad Baïou, Ali Ridha Mahjoub:
The Steiner Traveling Salesman Polytope and Related Polyhedra. SIAM J. Optim. 13(2): 498-507 (2002) - 2001
- [j27]Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
Steiner trees and polyhedra. Discret. Appl. Math. 112(1-3): 101-120 (2001) - 2000
- [j26]Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of graphs and the triangle free subgraph polytope. Electron. Notes Discret. Math. 5: 19-22 (2000) - [j25]Ali Ridha Mahjoub, Pierre Pesneau:
On Steiner 2-edge connected polytopes. Electron. Notes Discret. Math. 5: 210-213 (2000) - [j24]Mohamed Didi Biha, Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra. J. Comb. Optim. 4(1): 131-144 (2000) - [j23]Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub:
Separation of Partition Inequalities. Math. Oper. Res. 25(2): 243-254 (2000)
1990 – 1999
- 1999
- [j22]Ali Ridha Mahjoub, Charles Nocq:
On the Linear Relaxation of the 2-node Connected Subgraph Polytope. Discret. Appl. Math. 95(1-3): 389-416 (1999) - [c2]Jean Fonlupt, Ali Ridha Mahjoub:
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. IPCO 1999: 166-182 - 1997
- [j21]Mustapha Bouchakour, Ali Ridha Mahjoub:
One-node cutsets and the dominating set polytope. Discret. Math. 165-166: 101-123 (1997) - [j20]Ali Ridha Mahjoub:
On perfectly two-edge connected graphs. Discret. Math. 170(1-3): 153-172 (1997) - [j19]Mourad Baïou, Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. SIAM J. Discret. Math. 10(3): 505-514 (1997) - 1996
- [j18]Mohamed Didi Biha, Ali Ridha Mahjoub:
k-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19(2): 71-78 (1996) - 1995
- [j17]Ali Ridha Mahjoub:
A Min-max Relation for K3-covers in Graphs Noncontractible to K5e. Discret. Appl. Math. 62(1-3): 209-219 (1995) - [j16]Francisco Barahona, Ali Ridha Mahjoub:
On two-connected subgraph polytopes. Discret. Math. 147(1-3): 19-34 (1995) - 1994
- [j15]Ali Ridha Mahjoub:
Two-edge connected spanning subgraphs and polyhedra. Math. Program. 64: 199-208 (1994) - [j14]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. SIAM J. Discret. Math. 7(3): 344-358 (1994) - [j13]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra II: Stable Sets. SIAM J. Discret. Math. 7(3): 359-371 (1994) - [j12]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. SIAM J. Discret. Math. 7(3): 372-389 (1994) - [j11]Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM J. Discret. Math. 7(3): 390-402 (1994) - 1992
- [j10]Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry:
Compositions in the bipartite subgraph polytope. Discret. Math. 105(1-3): 73-91 (1992) - [c1]Francisco Barahona, Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes. IPCO 1992: 30-43 - 1991
- [j9]Reinhardt Euler, Ali Ridha Mahjoub:
On a composition of independence systems by circuit identification. J. Comb. Theory B 53(2): 235-259 (1991) - 1990
- [j8]Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub:
A note on Ki-perfect graphs. J. Graph Theory 14(3): 333-340 (1990)
1980 – 1989
- 1989
- [j7]Francisco Barahona, Ali Ridha Mahjoub:
Facets of the balanced (acyclic) induced subgraph polytope. Math. Program. 45(1-3): 21-33 (1989) - 1988
- [j6]Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix:
Book reviews. ZOR Methods Model. Oper. Res. 32(5): 346-351 (1988) - [j5]Ali Ridha Mahjoub:
On the stable set polytope of a series-parallel graph. Math. Program. 40(1-3): 53-57 (1988) - 1987
- [j4]Michele Conforti, Derek Gordon Corneil, Ali Ridha Mahjoub:
Ki-covers. II. Ki-perfect graphs. J. Graph Theory 11(4): 569-584 (1987) - 1986
- [j3]Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub:
Ki-covers I: Complexity and polytopes. Discret. Math. 58(2): 121-142 (1986) - [j2]Francisco Barahona, Ali Ridha Mahjoub:
On the cut polytope. Math. Program. 36(2): 157-173 (1986) - 1985
- [b2]Ali Ridha Mahjoub:
Étude de structures combinatoires issues de la physique statistique et d'autres domaines. (Analysis of combinatorial structures issued from statistical physics and other domains). Joseph Fourier University, Grenoble, France, 1985 - [j1]Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub:
Facets of the Bipartite Subgraph Polytope. Math. Oper. Res. 10(2): 340-358 (1985) - 1981
- [b1]Ali Ridha Mahjoub:
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). Grenoble Institute of Technology, France, 1981
Coauthor Index
I. Diarrassouba
aka: Ibrahima Diarrassouba
aka: Ibrahima Diarrassouba
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
