A bootstrap heuristic for designing minimum cost survivable networks

DOI10.1016/0305-0548(94)00076-KzbMath0857.90036MaRDI QIDQ1919975

Lloyd W. Clarke, G. Anandalingam

Publication date: 30 October 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsdesign systemminimum cost survivable networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

A bootstrap heuristic for designing minimum cost survivable networks ⋮ Box-total dual integrality and edge-connectivity ⋮ Survivable network design under optimal and heuristic interdiction scenarios

Uses Software

• Algorithm 447
• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• A bootstrap heuristic for designing minimum cost survivable networks
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• Synthesis of reliable networks - a survey
• Minimum augmentation of a tree to a K-edge-connected graph
• The minimum augmentation of a directed tree to ak-edge-connected directed graph
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Greek Astronomy and its Debt to the Babylonians

This page was built for publication: A bootstrap heuristic for designing minimum cost survivable networks