On the k edge-disjoint 2-hop-constrained paths polytope

Operations Research Letters

Volumn 34, Issue 5, 2006, Pages 577-582

  Dahl, Geir ^a   Huygens, David ^b   Mahjoub, A Ridha ^c   Pesneau, Pierre ^d  

^a UNIVERSITY OF OSLO   (Norway)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITÉ BLAISE PASCAL   (France)

^d UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Edge disjoint paths; Facet; Hop constraint; Polyhedron; Survivable network

Indexed keywords

CONSTRAINT THEORY; COSTS; OPTIMIZATION;

EDGE-DISJOINT PATHS; FACET; HOP-CONSTRAINT; POLYHEDRON; SURVIVABLE NETWORK;

OPERATIONS RESEARCH;

EID: 33744909576     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.09.001     Document Type: Article

References (8)

1. Dahl G. Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25 2 (1999) 97-100
2. Dahl G., and Gouveia L. On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32 (2004) 15-22
3. Dahl G., and Johannessen B. The 2-path network problem. Networks 43 3 (2004) 190-199
4. B. Fortz, A.R. Mahjoub, S.T. McCormick, P. Pesneau, The 2-edge connected subgraph problem with bounded rings, Math. Program., to appear.
5. Hao J., and Orlin J.B. A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17 3 (1994) 424-446
6. Huygens D., Mahjoub A.R., and Pesneau P. Two edge-disjoint hop-constrained paths and polyhedra. SIAM J. Discrete Math. 18 2 (2004) 287-312
7. Pulleyblank W.R. Polyhedral combinatorics. In: Nemhauser G.L., Rinnooy Kan A.H.G., and Todd M.J. (Eds). Optimization, Handbooks Operations Research and Management Science vol. 1 (1989), North-Holland, Amsterdam 371-446
8. Schrijver A. Combinatorial Optimization-Polyhedra and Efficiency. Algorithms and Combinatorics vol. 24 (2003), Springer, Berlin, Heidelberg