Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints

Clyde L. Monma and David F. Shallcross
Additional contact information
Clyde L. Monma: Bell communications Research, Morristown, New Jersey
David F. Shallcross: Cornell University, Ithaca, New York

Operations Research, 1989, vol. 37, issue 4, 531-541

Abstract: In this paper, we consider the problem of designing a minimum cost communication network subject to certain two-connected survivability constraints. This problem was motivated by work at Bellcore on planning fiber optic communications networks. We introduce heuristics for constructing initial feasible networks, and local improvement heuristics for reducing the cost of existing network designs while preserving a feasible network. This approach is shown to be effective on data from both real-world fiber optic communications network problems and randomly generated problems.

Keywords: communications: applications; computer science: microcomputer software; networks/graphs: heuristics (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.531 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:4:p:531-541

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().