Hop-level flow formulation for the survivable network design with hop constraints problem

Networks

Volumn 61, Issue 2, 2013, Pages 171-179

  Mahjoub, A Ridha ^a   Simonetti, Luidi ^b   Uchoa, Eduardo ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

extended formulations; network design; survivability

Indexed keywords

EDGE-DISJOINT PATHS; EFFICIENT FORMULATION; EXTENDED FORMULATIONS; HOP-CONSTRAINTS; MINIMUM COST; MULTICOMMODITY FLOW (MCF); NETWORK DESIGN; SUBGRAPHS; SURVIVABILITY; SURVIVABLE NETWORK DESIGN;

COMPUTER NETWORKS; INFORMATION SYSTEMS;

GRAPH THEORY;

EID: 84873985502     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21483     Document Type: Conference Paper

References (15)

1. F. Bendali, I. Diarrassouba, A. Mahjoub, and J. Mailfert, The k edge-disjoint 3-hop-constrained paths polytope, Discrete Optim 7 (2010), 222-233.
2. Q. Botton, B. Fortz, and L. Gouveia, "Le polyèdre du problème de conception de réseaux robustes k-arête connexe avec 3 sauts," Journées Polyèdres et Optimisation Comb, Université Blaise-Pascal, Clermont-Ferrand, France, 2008, pp. 13-18.
3. Q. Botton, B. Fortz, L. Gouveia, and M. Poss, Benders decomposition for the hop-constrained survivable network design problem, INFORMS J Comput (2011), in press.
4. G. Dahl, Notes on polyhedra associated with hop-constrained paths, Oper Res Lett 25 (1999), 97-100.
5. G. Dahl, D. Huygens, A. Mahjoub, and P. Pesneau, On the k edge-disjoint 2-hop-constrained paths polytope, Oper Res Lett 34 (2006), 577-582.
6. I. Diarrassouba, Survivable network design problems with high survivability requirements, Ph.D. Thesis, Université Blaise Pascal Clermond-Ferrand II, France, 2009.
7. I. Diarrassouba,V. Gabrel, and A. Mahjoub, "Le problème de conception de réseau fiable avec contrainte de borne," Proc ROADEF, Toulouse, 2010, pp. 299-301.
8. L. Gouveia, Multicommodity flow models for spanning trees with hop constraints, Eur J Oper Res 95 (1996), 178-190.
9. L. Gouveia, L. Simonetti, and E. Uchoa, Modeling hopconstrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Math Program 128 (2011), 123-148.
10. D. Huygens, M. Labbé, A. Mahjoub, and P. Pesneau, The twoedge connected hop-constrained network design problem: Valid inequalities and branch-and-cut, Networks 49 (2007), 116-133.
11. D. Huygens and A. Mahjoub, Integer programming formulations for the two 4-hop-constrained paths problem, Networks 49 (2007), 135-144.
12. D. Huygens, A. Mahjoub, and P. Pesneau, Two edge-disjoint hop-constrained paths and polyhedra, SIAM J Discr Math 18 (2004), 287-312.
13. A. Itai, Y. Perl, and Y. Shiloach, The complexity of finding maximum disjoint paths with length constraints, Networks 12 (1982), 277-286.
14. H. Kerivin and A. Mahjoub, Design of survivable networks: A survey, Networks 46 (2005), 1-21.
15. E. Uchoa, "Cuts over extended formulations by flow discretization," Progress in combinatorial optimization, A. Mahjoub (Editor), ISTE-Wiley, London, 2011, pp. 255-282.