Designing hierarchical survivable networks

Operations Research

Volumn 46, Issue 1, 1998, Pages 116-136

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

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Networks graphs, heuristics: analysis for hierarchical, survivable applications; Networks graphs, tree algorithms: hierarchical, survivable networks; Programming, integer, heuristics: multifacility, reliable telecommunications networks

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONGESTION CONTROL (COMMUNICATION); COST EFFECTIVENESS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC; VALUE ENGINEERING;

MULTI TIER SURVIVABLE NETWORK DESIGN MODEL;

TELECOMMUNICATION NETWORKS;

EID: 0031674198     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.1.116     Document Type: Article

References (17)

1. AHUJA, R., T. L. MAGNANTI, AND J. B. ORLIN. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. BALAKRISHNAN, A., T. L. MAGNANTI, AND P. MIRCHANDANI. 1994a. Modeling and Worst-case Performance Analysis of the Two-level Network Design Problem. Mgmt. Sci. 40, 846-867.
3. BALAKRISHNAN, A., T. L. MAGNANTI, AND P. MIRCHANDANI. 1994b. A Dual-based Algorithm for Multi-level Network Design. Mgmt. Sci. 40, 567-581.
4. BALAKRISHNAN, A., T. L. MAGNANTI, AND P. MIRCHANDANI. 1994c. Designing Low Connectivity Steiner Networks. Working Paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
5. BALAKRISHNAN, A., T. L. MAGNANTI, AND P. MIRCHANDANI. 1994d. Designing Hierarchical Survivable Networks. Working Paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
6. BALAKRISHNAN, A., T. L. MAGNANTI, AND P. MIRCHANDANI. 1996. Heuristics, LPs, and Trees on Trees: Network Design Analyses. Opns. Res. 44, 478-496.
7. BERMAN, S. AND V. RAMAIYER. 1992. An Approximation Algorithm for the Steiner Tree Problem. Proc. of the Third ACM-SIAM Symposium on Discrete Algorithms.
8. CORNUÉJOLS, G., J. FONLUPT, AND D. NADDEF. 1985. The Traveling Salesman Problem on a Graph and Some Related Polyhedra. Math. Prog. 33, 1-27.
9. COSARES, S., D. N. DEUTSCH, I. SAINEE, O. J. WASEM. 1995. SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fibre-Optic Networks. Interfaces, 25, 20-40.
10. CURRENT, J. R., C. S. REVELLE, AND J. L. COHON. 1986. The Hierarchical Network Design Problem. Eur. J. Oper. Res. 27, 57-66.
11. EDMONDS, J. 1979. Matroid Intersection. Ann. Discrete Math. 4, 39-49.
12. FORD, L. R. AND D. R. FULKERSON. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
13. GOEMANS, M. X. AND D. J. BERTSIMAS. 1993. Survivable Networks, Linear Programming Relaxations and the Parsimonious Property. Math. Prog. 60, 145-166.
14. GRÖTSCHEL, M., C. L. MONMA, AND M. STOER. 1992. Computational Results with Cutting Plane Algorithm for Designing Communication Networks with Low-connectivity Constraints. Opns. Res. 40, 309-330.
15. MAGNANTI, T. L. AND S. RAGHAVAN. 1992. A Dual-Ascent Procedure for Network Design with Connectivity Requirements. ORSA/TIMS Joint National Meeting, San Francisco, November 1992.
16. MONMA, C. L., B. S. MUNSON, AND W. R. PULLEYBLANK. 1990. Minimum-weight Two-connected Spanning Networks. Math. Prog. 46, 153-171.
17. TAKAHASHI, H. AND A. MATSUYAMA. 1980. An Approximation Solution for the Steiner Problem in Graphs. Mathematica Japonica, 24, 573-577.