Designing Hierarchical Survivable Networks

References

• Ahuja R. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. Modeling and worst-case performance analysis of the two-level network design problem. Management Sci. (1994a) 40 846 867 Link, Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. A dual-based algorithm for multi-level network design. Management Sci. (1994b) 40 567 581 Link, Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. Designing low connectivity Steiner networks. (1994c) . Working paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. Designing hierarchical survivable networks. (1994d) . Working paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA Google Scholar
• Balakrishnan A. , Magnanti T. L. , Mirchandani P. Heuristics, LPs, and trees on trees: Network design analyses. Opns. Res. (1996) 44 478 496 Link, Google Scholar
• Berman S. , Ramaiyer V. An approximation algorithm for the Steiner tree problem. Proc. of the Third ACM-SIAM Sympos. on Discrete Algorithms (1992) Google Scholar
• Cornuéjols G. , Fonlupt J. , Naddef D. The traveling salesman problem on a graph and some related polyhedra. Math. Prog. (1985) 33 1 27 Crossref, Google Scholar
• Cosares S. , Deutsch D. N. , Sainee I. , Wasem O. J. SONET toolkit: A decision support system for designing robust and cost-effective fibre-optic networks. Interfaces (1995) 25 20 40 Link, Google Scholar
• Current J. R. , Revelle C. S. , Cohon J. L. The hierarchical network design problem. Eur. J. Oper. Res. (1986) 27 57 66 Crossref, Google Scholar
• Edmonds J. Matroid intersection. Ann. Discrete Math. (1979) 4 39 49 Crossref, Google Scholar
• Ford L. R. , Fulkerson D. R. Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Goemans M. X. , Bertsimas D. J. Survivable networks, linear programming relaxations and the parsimonious property. Math. Prog. (1993) 60 145 166 Crossref, Google Scholar
• Grötschel M. , Monma C. L. , Stoer M. Computational results with cutting plane algorithm for designing communication networks with low-connectivity constraints. Opns. Res. (1992) 40 309 330 Link, Google Scholar
• Magnanti T. L. , Raghavan S. A dual-ascent procedure for network design with connectivity requirements. (1992) . ORSA/TIMS Joint National Meeting, San Francisco, November 1992 Google Scholar
• Monma C. L. , Munson B. S. , Pulleyblank W. R. Minimum-weight two-connected spanning networks. Math. Prog. (1990) 46 153 171 Crossref, Google Scholar
• Takahashi H. , Matsuyama A. An approximation solution for the Steiner problem in graphs. Mathematica Japonica (1980) 24 573 577 Google Scholar