Connectivity-Splitting Models for Survivable Network Design

Networks

Volumn 43, Issue 1, 2004, Pages 10-27

  Balakrishnan, Anantaram ^a   Magnanti, Thomas L ^b   Mirchandani, Prakash ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b Massachusetts Institute of Technology Cambridge   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Heuristics; Integer programming; Model formulation; Network design; Survivability; Worst case performance

Indexed keywords

HEURISTICS; MODEL FORMULATION; NETWORK DESIGN; SURVIVABILITY; WORST-CASE PERFORMANCE;

COMPUTER SIMULATION; COST BENEFIT ANALYSIS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

TELECOMMUNICATION NETWORKS;

EID: 2042542090     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10100     Document Type: Article

References (23)

1. K. Ambs, S. Cwilich, M. Deng, D.J. Houck, D.F. Lynch, and D. Yan, Optimizing restoration capacity in the AT&T network, Interfaces 30 (2000), 26-44.
2. A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, A dual-based algorithm for multi-level network design, Manag Sci 40 (1994), 567-581.
3. A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, Modeling and worst-case performance analysis of the two-level network design problem, Manag Sci 40 (1994), 846-867.
4. A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, Doubling or splitting: Strategies for modeling and analyzing survivable network design problems, Working paper OR297-94, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 1994.
5. A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, Oper Res Lett 29 (2001), 99-106.
6. J.E. Beasley, An algorithm for the Steiner problem in graphs, Networks 14 (1984), 147-159.
7. D. Bienstock, S. Chopra, O. Günlük, and C.-Y. Tsai, Minimum cost capacity installation for multicommodity flows, Math Program 81 (1998), 177-199.
8. S. Cosares, D.N. Deutch, I. Saniee, and O.J. Wasem, SONET toolkit: A decision support system for the design of robust and cost effective fiber-optic networks, Interfaces 25 (1995), 20-40.
9. M.X. Goemans and D.J. Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Math Program 60 (1993), 145-166.
10. M.X. Goemans and Y.-S. Myung, A catalog of Steiner tree formulations, Networks 23 (1993), 19-28.
11. M.X. Goemans and D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24 (1995), 296-317.
12. M.X. Goemans, A.V. Goldberg, S. Plotkin, D.B. Shmoys, E. Tardos, and D.P. Williamson, Improved approximation algorithms for network design problems, Proc 5th ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 223-232.
13. M. Grötschel, C.L. Monma, and M. Stoer, "Design of survivable communications networks," Handbooks in operations research and management science: Network models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam, 1995, pp. 617-672.
14. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica 21 (2001), 39-60.
15. T.L. Magnanti and S. Raghavan, Strong formulations for network design problems with connectivity requirements, Working paper OR332-99, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 1999.
16. T.L. Magnanti and L.A. Wolsey, "Optimal trees," Handbooks in operations research and management science: Network models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam, 1995, pp. 503-616.
17. P. Mirchandani, Projections of the capacitated network loading problem, Eur J Oper Res 122 (2000), 534-560.
18. C.L. Monma, B.S. Munson, and W.R. Pulleyblank, Minimum-weight two-connected spanning networks, Math Program 46 (1990), 153-171.
19. G. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
20. S. Raghavan and T.L. Magnanti, "Network connectivity," Annotated bibliographies in combinatorial optimization, M. Dell'Amico, F. Maffioli, and S. Martello (Editors), Wiley, New York, 1997, pp. 335-354.
21. R.L. Rardin and U. Choe, Tighter relaxations of fixed charge network flow problems, Technical report, J-79-18, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1979.
22. D.P. Williamson, M.X. Goemans, M. Mihail, and V.V. Vazirani, A primal-dual approximation algorithm for the generalized Steiner network problem, Combinatorica 15 (1995), 435-454.
23. R.T. Wong, A dual-ascent approach for Steiner tree problems on a directed graph, Math Program 28 (1984), 271-287.