Two edge-disjoint HOP-constrained paths and polyhedra

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 287-312

  Huygens, David ^a   Mahjoub, Ali Ridha ^b   Pesneau, Pierre ^b,c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITÉ BLAISE PASCAL   (France)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

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

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

EDGE-DISJOINT PATHS; FACET; HOP-CONSTRAINTS; POLYHEDRON; SURVIVABLE NETWORKS;

CONSTRAINT THEORY;

EID: 18744376600     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102419445     Document Type: Article

References (38)

1. A. BALAKRISHNAN AND K. ALTINKEMER, Using a hop-constrained model to generate alternative communication network design, ORSA J. Comput., 4 (1992), pp. 192-205.
2. M. BAÏOU AND A. R. MAHJOUB, Steiner 2-edge connected subgraph polytopes on series-parallel graphs, SIAM J. Discrete Math., 10 (1997), pp. 505-514.
3. F. BARAHONA AND A. R. MAHJOUB, On two-connected subgraphs polytopes, Discrete Math., 147 (1995), pp. 19-34.
4. W. BEN-AMEUR, Constrained length connectivity and survivable networks, Networks, 36 (2000), pp. 17-33.
5. W. BEN-AMEUR AND E. GOURDIN, Internet routing and related topology issues, SIAM J. Discrete Math., 17 (2003), pp. 18-49.
6. M. D. BIHA AND A. R. MAHJOUB, Steiner k-edge connected subgraph polytope, J. Comb. Optim., 4 (2000), pp. 131-144.
7. A. BLEY, On the complexity of vertex-disjoint length-restricted path problems, Comput. Complexity, to appear.
8. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, Universities Press, Belfast, 1976.
9. S. C. BOYD AND T. HAO, An integer polytope related to the design of survivable communication networks, SIAM J. Discrete Math., 6 (1993), pp. 612-630.
10. C. R. COULLARD, A. B. GAMBLE, AND J. LIU, The k-walk polyhedron, in Advances in Optimization and Approximation, Nonconvex Optim. Appl. 1, D.-Z. Du and J. Sun, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994, pp. 9-29.
11. G. DAHL, The 2-hop spanning tree problem, Oper. Res. Lett., 23 (1998), pp. 21-26.
12. G. DAHL, Notes on polyhedra associated with hop-constrained paths, Oper. Res. Lett., 25 (1999), pp. 97-100.
13. G. DAHL AND L. GOUVEIA, On Formulations of the Hop-Constrained Minimum Spanning Tree Problem, preprint, 2001.
14. G. DAHL AND B. JOHANNESSEN, The 2-path network problem, Networks, 43 (2004), pp. 190-199.
15. J. FONLUPT AND A. R. MAHJOUB, Critical extreme points of the 2-edge connected spanning subgaph polytope, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1610, G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, eds., Springer-Verlag, Berlin, 1999, pp. 166-182.
16. B. FORTZ, M. LABB, AND F. MAFFIOLI, Solving the two-connected network with bounded meshes problem, Oper. Res., 48 (2000), pp. 866-877.
17. B. FORTZ, A. R. MAHJOUB, S. T. MCCORMICK, AND P. PESNEAU, The 2-Edge Connected Subgraph Problem with Bounded Rings, Working paper 98/03, IAG, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 2003.
18. H. N. GABOW, M. X. GOEMANS, AND D. P. WILLIAMSON, An efficient approximation algorithm for the survivable network design problem, Networks and matroids; Sequencing and scheduling. Math. Programming, 82 (1998), pp. 13-40.
19. L. GOUVEIA, Multicommodity flow models for spanning trees with hop constraints, European J. Oper. Res., 95 (1996), pp. 178-190.
20. L. GOUVEIA, Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints, INFORMS J. Comput., 10 (1998), pp. 180-188.
21. L. GOUVEIA AND E. JANSSEN, Designing reliable tree networks with two cable technologies, European J. Oper. Res., 105 (1998), pp. 552-568.
22. L. GOUVEIA AND T. L. MAGNANTI, Modelling and Solving the Diameter-Constrained Minimum Spanning Tree Problem, Technical report, DEIO-CIO, Faculdade de Ciências da Universidade de Lisboa, 2000.
23. L. GOUVEIA AND C. REQUEJO, A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, European J. Oper. Res., 132 (2001), pp. 539-552.
24. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
25. M. GRÖTSCHEL AND C. L. MONMA, Integer polyhedra arising from certain networks design problems with connectivity constraints, SIAM J. Discrete Math., 3 (1990), pp. 502-523.
26. M. GRÖTSCHEL, C. L. MONMA, AND M. STOER, Polyhedral approaches to network survivability, in Reliability of Computer and Communication Networks, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5, F. Roberts, F. Hwang, and C. L. Monma eds., AMS, Providence, RI, 1991, pp. 121-141.
27. M. GRÖTSCHEL, C. L. MONMA, AND M. STOER, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, SIAM J. Optim., 2 (1992), pp. 474-504.
28. M. GRÖTSCHEL, C. L. MONMA, AND M. STOER, Design of survivable networks, in Network Models, Handbooks Oper. Res. Management Sci. 7, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., North-Holland, Amsterdam, 1995, pp. 617-671.
29. J. HAO AND J. B. ORLIN, A faster algorithm for finding the minimum cut in a directed graph, J. Algorithms, 17 (1994), pp. 424-446.
30. A. ITAI, Y. PERL, AND Y. SHILOACH, The complexity of finding maximum disjoint paths with length constraints, Networks, 12 (1982), pp. 277-286.
31. K. JAIN, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21 (2001), pp. 39-60.
32. H. KERIVIN, A. R. MAHJOUB, AND C. NOCQ, (1, 2)-survivable networks: Facets and branch-and-cut, in The Sharpest Cut: The Impact of Manfred Padberg and His Work, MPS/SIAM Ser. Optim., M. Grötschel, ed., SIAM, Philadelphia, 2004, pp. 121-152.
33. L. J. LEBLANC AND R. REDDOCH, Reliable Link Topology/Capacity and Routing in Backbone Telecommunication Networks, Working paper 90-08, Owen Graduate School of Management, Vanderbilt University, Nashville, TN, 1990.
34. L. J. LEBLANC, R. REDDOCH, J. CHIFFLET, AND P. MAHEY, Packet routing in telecommunications networks with path and flow restrictions, INFORMS J. Comput., 11 (1999), pp. 188-197.
35. C.-L. LI, S. T. MCCORMICK, AND D. SIMCHI-LEVI, Finding disjoint paths with different path-costs: Complexity and algorithms, Networks, 22 (1992), pp. 653-667.
36. A. R. MAHJOUB, Two-edge connected spanning subgraphs and polyhedra, Math. Programming, 64 (1994), pp. 199-208.
37. H. PIRKUL AND S. SONI, New formulations and solution procedures for the hop constrained network design problem, European J. Oper. Res., 148 (2003), pp. 126-140.
38. W. R. PULLEYBLANK, Polyhedral combinatorics, in Optimization, Handbooks Oper. Res. Management Sci. 1, G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, eds., North-Holland, Amsterdam, 1989, pp. 371-446.