Ali Ridha Mahjoub

According to our database1, Ali Ridha Mahjoub authored at least 111 papers between 1981 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut.
Discret. Optim., 2020

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints.
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

A parallel hybrid optimization algorithm for some network design problems.
Soft Comput., 2019

Distance Transformation for Network Design Problems.
SIAM J. Optim., 2019

On the star forest polytope for trees and cycles.
RAIRO Oper. Res., 2019

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016.
J. Comb. Optim., 2019

The vertex k-cut problem.
Discret. Optim., 2019

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut.
Discret. Appl. Math., 2019

A layered compact formulation for the Multiple Steiner TSP with Order constraints.
Proceedings of the 6th International Conference on Control, 2019

A special case of Variable-Sized Bin Packing Problem with Color Constraints.
Proceedings of the 6th International Conference on Control, 2019

2018
Optimization algorithms for the disjunctively constrained knapsack problem.
Soft Comput., 2018

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP.
RAIRO Oper. Res., 2018

A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems.
Electron. Notes Discret. Math., 2018

The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut.
Electron. Notes Discret. Math., 2018

A Hybrid Optimization Approach For the Steiner <i>k</i>-Connected Network Design Problem.
Electron. Notes Discret. Math., 2018

Minimal arc-sets spanning dicycles.
Discret. Appl. Math., 2018

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem.
Comput. Ind. Eng., 2018

Assessing the risk of complex ICT systems.
Ann. des Télécommunications, 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

Randomized Contractions for Multiobjective Minimum Cuts.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Two node-disjoint hop-constrained survivable network design and polyhedra.
Networks, 2016

Integer programming formulations for the <i>k</i>-edge-connected 3-hop-constrained network design problem.
Networks, 2016

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut.
Electron. Notes Discret. Math., 2016

Preface.
Discret. Optim., 2016

Unsplittable non-additive capacitated network design using set functions polyhedra.
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

The k-node-connected subgraph problem: Facets and Branch-and-Cut.
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

Polyhedral analysis for the disjunctively constrained Knapsack Problem.
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

A New Risk Assessment Framework Using Graph Theory for Complex ICT Systems.
Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, 2016

2015
Preface.
Math. Program., 2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Math. Program., 2015

2014
Preface.
RAIRO Oper. Res., 2014

Survivability in Hierarchical Telecommunications Networks Under Dual Homing.
INFORMS J. Comput., 2014

Preface.
Discret. Appl. Math., 2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.
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

On minimal two-edge-connected graphs.
Proceedings of the International Conference on Control, 2014

Mathematical formulations for the Balanced Vertex k-Separator Problem.
Proceedings of the International Conference on Control, 2014

On the star forest polytope.
Proceedings of the International Conference on Control, 2014

2013
Hop-level flow formulation for the survivable network design with hop constraints problem.
Networks, 2013

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra.
Electron. Notes Discret. Math., 2013

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints.
Electron. Notes Discret. Math., 2013

Capacitated Network Design using Bin-Packing.
Electron. Notes Discret. Math., 2013

Hose workload based exact algorithm for the optimal design of virtual private networks.
Comput. Networks, 2013

2012
On the NP-completeness of the perfect matching free subgraph problem.
Theor. Comput. Sci., 2012

Survivability in hierarchical telecommunications networks.
Networks, 2012

Models for the single-vehicle preemptive pickup and delivery problem.
J. Comb. Optim., 2012

Solving VLSI design and DNA sequencing problems using bipartization of graphs.
Comput. Optim. Appl., 2012

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.
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

Multilayer Survivable Optical Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

On the Design of Optical OFDM-Based Networks.
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
A branch-and-cut algorithm for the <i>k</i>-edge connected subgraph problem.
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

The k edge-disjoint 3-hop-constrained paths polytope.
Discret. Optim., 2010

2009
Generating Facets for the Independence System Polytope.
SIAM J. Discret. Math., 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
On the Polytope of the (1, 2)-Survivable Network Design Problem.
SIAM J. Discret. Math., 2008

On the dominating set polytope.
Eur. J. Comb., 2008

2007
The Maximum Induced Bipartite Subgraph Problem with Edge Weights.
SIAM J. Discret. Math., 2007

Editorial.
RAIRO Oper. Res., 2007

Integer programming formulations for the two 4-hop-constrained paths problem.
Networks, 2007

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
Networks, 2007

2006
On the <i>k</i> edge-disjoint 2-hop-constrained paths polytope.
Oper. Res. Lett., 2006

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program., 2006

Critical extreme points of the 2-edge connected spanning subgraph polytope.
Math. Program., 2006

On the independent dominating set polytope.
Eur. J. Comb., 2006

Polyhedral results for the bipartite induced subgraph problem.
Discret. Appl. Math., 2006

Design of survivable IP-over-optical networks.
Ann. Oper. Res., 2006

2005
Design of Survivable Networks: A survey.
Networks, 2005

On survivable network polyhedra.
Discret. Math., 2005

2004
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra.
SIAM J. Discret. Math., 2004

(1, 2)-Survivable Networks: Facets and Branch-and-Cut.
Proceedings of the Sharpest Cut, 2004

2002
The Steiner Traveling Salesman Polytope and Related Polyhedra.
SIAM J. Optim., 2002

Separation of partition inequalities for the (1, 2)-survivable network design problem.
Oper. Res. Lett., 2002

2001
Steiner trees and polyhedra.
Discret. Appl. Math., 2001

2000
Separation of Partition Inequalities.
Math. Oper. Res., 2000

Steiner k-Edge Connected Subgraph Polyhedra.
J. Comb. Optim., 2000

On Steiner 2-edge connected polytopes.
Electron. Notes Discret. Math., 2000

Composition of graphs and the triangle free subgraph polytope.
Electron. Notes Discret. Math., 2000

1999
On the Linear Relaxation of the 2-node Connected Subgraph Polytope.
Discret. Appl. Math., 1999

1997
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.
SIAM J. Discret. Math., 1997

On perfectly two-edge connected graphs.
Discret. Math., 1997

One-node cutsets and the dominating set polytope.
Discret. Math., 1997

1995
On two-connected subgraph polytopes.
Discret. Math., 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
Compositions of Graphs and Polyhedra III: Graphs with No W<sub>4</sub> Minor.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra II: Stable Sets.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discret. Math., 1994

Two-edge connected spanning subgraphs and polyhedra.
Math. Program., 1994

1992
Compositions in the bipartite subgraph polytope.
Discret. Math., 1992

On 2-Connected Subgraph Polytopes.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
On a composition of independence systems by circuit identification.
J. Comb. Theory, Ser. B, 1991

1990
A note on <i>K<sub>i</sub></i>-perfect graphs.
J. Graph Theory, 1990

1989
Facets of the balanced (acyclic) induced subgraph polytope.
Math. Program., 1989

1988
On the stable set polytope of a series-parallel graph.
Math. Program., 1988

Book reviews.
ZOR Methods Model. Oper. Res., 1988

1987
<i>K</i><sub><i>i</i></sub>-covers. II. <i>K</i><sub><i>i</i></sub>-perfect graphs.
J. Graph Theory, 1987

1986
On the cut polytope.
Math. Program., 1986

K<sub>i</sub>-covers I: Complexity and polytopes.
Discret. Math., 1986

1985
Facets of the Bipartite Subgraph Polytope.
Math. Oper. Res., 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


  Loading...