A bootstrap heuristic for designing minimum cost survivable networks
type: Item
instance of: scholarly article
title: A bootstrap heuristic for designing minimum cost survivable networks
zbMATH Open document ID: 0857.90036
DOI: 10.1016/0305-0548(94)00076-K
author: Lloyd W. Clarke
author: G. (Anand) Anandalingam
published in: Computers \& Operations Research
publication date: 1996-10-30T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 910351
zbMATH Keywords: minimum cost survivable networks
zbMATH Keywords: heuristics
zbMATH Keywords: design system
describes a project that uses: Algorithm 447
describes a project that uses: XMP
MaRDI profile type: Publication
cites work: Synthesis of reliable networks - a survey
cites work: Q3929516
cites work: Q4845372
cites work: Minimum augmentation of a tree to a K-edge-connected graph
cites work: The minimum augmentation of a directed tree to ak-edge-connected directed graph
cites work: Greek Astronomy and its Debt to the Babylonians
cites work: An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
cites work: Q4035361
cites work: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
cites work: Minimum-weight two-connected spanning networks
cites work: Q3677509
description: scientific article; zbMATH DE number 910351