Connectivity upgrade models for survivable network design

Operations Research

Volumn 57, Issue 1, 2009, Pages 170-186

  Balakrishnan, Anantaram ^a   Mirchandani, Prakash ^b   Natarajan, Harihara Prasad ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

^c UNIVERSITY OF MIAMI   (United States)

Author keywords

Integer programming: Cutting plane facet; Networks graphs: Applications, theory

Indexed keywords

APPROXIMATE SOLUTIONS; COMPUTATIONAL TESTS; CONNECTIVITY STRUCTURES; CORE MODELS; CUTTING PLANE ALGORITHMS; HEURISTIC PROCEDURES; HEURISTIC SOLUTIONS; HEURISTIC STRATEGIES; INFRASTRUCTURE NETWORKS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MULTI-COMMODITY FLOWS; NETWORK DIMENSIONS; NETWORK PLANNERS; NETWORK SERVICE PROVIDERS; NETWORKS/GRAPHS: APPLICATIONS, THEORY; PERFORMANCE GUARANTEES; PROBLEM SIZES; PROGRAMMING SOLUTIONS; SOLUTION APPROACHES; SURVIVABLE NETWORK DESIGNS; TOPOLOGICAL DESIGNS; TRANSPORT MATERIALS; VALID INEQUALITIES;

CONTROL THEORY; DYNAMIC PROGRAMMING; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; INVESTMENTS; LINEARIZATION; PARTICLE SIZE ANALYSIS;

HEURISTIC METHODS;

EID: 61449090393     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0579     Document Type: Article

References (25)

1. Anderson, P. L., I. K. Geckil. 2003. Northeast blackout likely to reduce U.S. earnings by $6.4 billion. Working Paper 2003-2, Anderson Economic Group, Lansing, MI.
2. Balakrishnan, A., T. L. Magnanti, P. Mirchandani. 1994. A dual-based algorithm for multi-level network design. Management Sci. 40 567-581.
3. Balakrishnan, A., T. L. Magnanti, P. Mirchandani. 2004. Connectivitysplitting models for survivable network design. Networks 43 10-27.
4. Balakrishnan, A., T. L. Magnanti, R. T. Wong. 1989. A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37 716-740.
5. Balakrishnan, A., T. L. Magnanti, J. Sokol, Y. Wang. 2002. Spare capacity assignment for line restoration using a single facility type. Oper. Res. 50 617-635.
6. Bienstock, D., G. Muratore. 2000. Strong inequalities for capacitated survivable network design problems. Math. Programming 89 127-147.
7. Dahl, G., M. Stoer. 1998. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10 1-11.
8. Gabow, H. N., M. X. Goemans, D. P. Williamson. 1998. An efficient approximation algorithm for the survivable network design problem. Math. Programming 82 13-40.
9. Goemans, M. X., D. J. Bertsimas. 1993. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming 60 145-166.
10. Gomory, R. E., T. C. Hu. 1961. Multi-terminal network flows. SIAM J. Appl. Math. 9 551-570.
11. Grötschel, M., C. L. Monma, M. Stoer. 1992a. Computational results with cutting plane algorithm, for designing communication networks with low-connectivity constraints. Oper. Res. 40 309-330.
12. Grötschel, M., C. L. Monma, M. Stoer. 1992b. Facets for polyhedra arising in the design of communication networks with low connectivity constraints. SIAM J. Optim. 2 474-504.
13. Grötschel, M., C. L. Monma, M. Stoer. 1995a. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper. Res. 43 1012-1024.
14. Grötschel, M., C. L. Monma, M. Stoer. 1995b. Design of survivable communications networks. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science: Network Models. North-Holland, Amsterdam, 617-672.
15. Huygens, D., A. R. Mahjoub, P. Pesneau. 2004. Two edge-disjoint hop-constrained paths and polyhedra. SIAM J. Discrete. Math. 18 287-312.
16. Jain, K. 2001. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21 39-60.
17. Kerivin, H., A. R. Mahjoub. 2005. On survivable network polyhedra. Discrete. Math. 290 183-210.
18. Luebke, E. L., J. S. Provan. 2000. On the structure and complexity of the 2-connected Steiner network problem, in the plane. Oper. Res. Lett. 26 111-116.
19. Magnanti, T. L., S. Raghavan. 2005. Strong formulations for network design problems with connectivity requirements. Networks 45 61-79.
20. Raghavan, S. 2004. Low-connectivity network design on series-parallel graphs. Networks 43 163-177.
21. Raghavan, S., T. L. Magnanti. 1997. Network connectivity. M. Dell'Amico, R Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, New York, 335-354.
22. Rajan, D., A. Atamtürk. 2004. A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43 201-211.
23. Stoer, M., G. Dahl. 1994. A polyhedral approach to multicommodity survivable network design. Numer. Math. 68 149-167.
24. Winter, P., M. Zachariasen. 2005. Two-connected Steiner networks: Structural properties. Oper: Res. Lett. 33 395-402.
25. Wong, R. T. 1984. A dual-ascent approach for Steiner tree problems on a directed graph. Math. Programming 28 271-287.