Ali Ridha Mahjoub
Orcid: 0000-0002-1079-1892
According to our database1,
Ali Ridha Mahjoub
authored at least 122 papers
between 1981 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Math. Program., January, 2024
2023
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut.
Comput. Ind. Eng., October, 2023
Proceedings of the 9th International Conference on Control, 2023
2022
The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm.
Proceedings of the 8th International Conference on Control, 2022
2021
Discret. Appl. Math., 2021
Preface: New trends on combinatorial optimization for network and logistical applications.
Ann. Oper. Res., 2021
2020
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms.
Soft Comput., 2020
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut.
Discret. Optim., 2020
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
2019
A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing.
Transp. Sci., 2019
Soft Comput., 2019
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016.
J. Comb. Optim., 2019
Discret. Appl. Math., 2019
Proceedings of the 6th International Conference on Control, 2019
Proceedings of the 6th International Conference on Control, 2019
2018
Soft Comput., 2018
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems.
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
A Hybrid Optimization Approach For the Steiner <i>k</i>-Connected Network Design Problem.
Electron. Notes Discret. Math., 2018
A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem.
Comput. Ind. Eng., 2018
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.
Ann. des Télécommunications, 2018
2017
The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut.
Comput. Ind. Eng., 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Networks, 2016
Integer programming formulations for the <i>k</i>-edge-connected 3-hop-constrained network design problem.
Networks, 2016
Electron. Notes Discret. Math., 2016
Comput. Oper. Res., 2016
A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016
Proceedings of the International Conference on Control, 2016
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.
Proceedings of the International Conference on Control, 2016
Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, 2016
2015
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Math. Program., 2015
2014
INFORMS J. Comput., 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Simulated evolution based algorithm versus exact method for virtual private network design.
Proceedings of the 10th International Conference on Natural Computation, 2014
Proceedings of the International Conference on Control, 2014
Proceedings of the International Conference on Control, 2014
Proceedings of the International Conference on Control, 2014
2013
Hop-level flow formulation for the survivable network design with hop constraints problem.
Networks, 2013
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
Hose workload based exact algorithm for the optimal design of virtual private networks.
Comput. Networks, 2013
2012
Theor. Comput. Sci., 2012
J. Comb. Optim., 2012
Comput. Optim. Appl., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.
Comput. Ind. Eng., 2011
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models.
Proceedings of the Seventh International Conference on Natural Computation, 2011
2010
Networks, 2010
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.
Math. Program., 2010
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.
Electron. Notes Discret. Math., 2010
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Electron. Notes Discret. Math., 2010
2009
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval.
Comput. Ind. Eng., 2009
2008
SIAM J. Discret. Math., 2008
2007
SIAM J. Discret. Math., 2007
Networks, 2007
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
Networks, 2007
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007
2006
Oper. Res. Lett., 2006
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program., 2006
Math. Program., 2006
Discret. Appl. Math., 2006
2005
2004
Proceedings of the Sharpest Cut, 2004
2002
Separation of partition inequalities for the (1, 2)-survivable network design problem.
Oper. Res. Lett., 2002
2001
2000
Electron. Notes Discret. Math., 2000
1999
Discret. Appl. Math., 1999
1997
SIAM J. Discret. Math., 1997
1996
1995
A Min-max Relation for K<sub>3</sub>-covers in Graphs Noncontractible to K<sub>5</sub>e.
Discret. Appl. Math., 1995
1994
SIAM J. Discret. Math., 1994
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.
SIAM J. Discret. Math., 1994
SIAM J. Discret. Math., 1994
1992
On 2-Connected Subgraph Polytopes.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
J. Comb. Theory, Ser. B, 1991
1990
1989
1988
1987
J. Graph Theory, 1987
1986
1985
Étude de structures combinatoires issues de la physique statistique et d'autres domaines. (Analysis of combinatorial structures issued from statistical physics and other domains).
, 1985
1981
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).
PhD thesis, 1981