A bootstrap heuristic for designing minimum cost survivable networks
Open Access
- 30 November 1995
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 22 (9), 921-934
- https://doi.org/10.1016/0305-0548(94)00076-k
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity ConstraintsSIAM Journal on Optimization, 1992
- Minimum-weight two-connected spanning networksMathematical Programming, 1990
- An Algorithm for Designing Survivable NetworksAT&T Technical Journal, 1989
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom SystemINFORMS Journal on Computing, 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
- An algorithm for construction of a k‐connected graph with minimum number of edges and quasiminimal diameterNetworks, 1984
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973