Ali Ridha Mahjoub
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ali Ridha Mahjoub has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Alain Quilliot
LIMOS CNRS 6158, Labex IMOBS3
1 shared publication - Bernard Fortz
Département d'Informatique Université libre de Bruxelles Brussels Belgium
1 shared publication - Bernard Liau
France Télécom Immeuble Bertrand, 6 place d’Alleray
1 shared publication - Carl W. Lee
University of Kentucky
1 shared publication - David Huygens
Département d'Informatique, Université Libre de Bruxelles, Boulevard du Triomphe, CP 210/01, 1050 Bruxelles, Belgium
1 shared publication - Eric Gourdin
38-40 rue du Général-Leclerc
1 shared publication
Latest Publications
- 30 April 2008
- Published by Elsevier in European Journal of Combinatorics
- Vol. 29 (3) , 652-661
On the dominating set polytope
- 30 April 2008
- Published by Elsevier in European Journal of Combinatorics
- Vol. 29 (3) , 652-661
On the dominating set polytope
- Open Access
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1513-1518
The capacitated vehicle routing problem with reloads
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1513-1518
Open AccessThe capacitated vehicle routing problem with reloads
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results
- 30 September 2006
- Published by Elsevier in Operations Research Letters
- Vol. 34 (5) , 577-582
On the k edge-disjoint 2-hop-constrained paths polytope
- 30 September 2006
- Published by Elsevier in Operations Research Letters
- Vol. 34 (5) , 577-582
On the k edge-disjoint 2-hop-constrained paths polytope
- 27 June 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 146 (1) , 41-73
Design of survivable IP-over-optical networks
- 27 June 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 146 (1) , 41-73
Design of survivable IP-over-optical networks
- 11 April 2006
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (15) , 2128-2149
Polyhedral results for the bipartite induced subgraph problem
- 11 April 2006
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (15) , 2128-2149
Polyhedral results for the bipartite induced subgraph problem
- 10 November 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (2-3) , 289-310
Critical extreme points of the 2-edge connected spanning subgraph polytope
- 10 November 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (2-3) , 289-310
Critical extreme points of the 2-edge connected spanning subgraph polytope
- Top Cited Papers
Design of Survivable Networks: A survey
For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 1–21 2005
Top Cited PapersDesign of Survivable Networks: A survey
For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 1–21 2005
- 14 March 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (1) , 85-111
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
- 14 March 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (1) , 85-111
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
- 31 August 2002
- Published by Elsevier in Operations Research Letters
- Vol. 30 (4) , 265-268
Separation of partition inequalities for the (1,2)-survivable network design problem
- 31 August 2002
- Published by Elsevier in Operations Research Letters
- Vol. 30 (4) , 265-268
Separation of partition inequalities for the (1,2)-survivable network design problem
- 1 September 2001
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 112 (1-3) , 101-120
Steiner trees and polyhedra
- 1 September 2001
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 112 (1-3) , 101-120
Steiner trees and polyhedra