An integrated system for designing minimum cost survivable telecommunications networks
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 26 (6), 856-862
- https://doi.org/10.1109/3468.541346
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A bootstrap heuristic for designing minimum cost survivable networksComputers & Operations Research, 1995
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity ConstraintsSIAM Journal on Optimization, 1992
- An Algorithm for Designing Survivable NetworksAT&T Technical Journal, 1989
- Fiberoptic circuit network design under reliability constraintsIEEE Journal on Selected Areas in Communications, 1989
- Minimum augmentation of a tree to a K‐edge‐connected graphNetworks, 1988
- The minimum augmentation of a directed tree to a k‐edge‐connected directed graphNetworks, 1986
- Disjoint Paths—A SurveySIAM Journal on Algebraic Discrete Methods, 1985
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- An algorithm for construction of a k‐connected graph with minimum number of edges and quasiminimal diameterNetworks, 1984
- Disjoint paths in a networkNetworks, 1974