Advertisement

Experiences with a Cutting Plane Algorithm in Survivable Network Design

  • Mechthild Stoer
Conference paper

Abstract

The problem of survivable network design came from an application of telecommunications industry, where network topologies are required to be connected after a failure of a certain number of links or nodes. One way to model survivability, accepted by practitioners at Bell Communkations Research, is the following.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [GMS92a]
    M. Grötschel, C. L. Monma, and M. Stoer. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization, 2(3), August 1992.Google Scholar
  2. [GMS92b]
    M. Grotschel, C. L. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40(2):309–330, 1992.CrossRefGoogle Scholar
  3. [GMS92c]
    M. Grotschel, C. L. Monma, and M. Stoer. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Konrad-Zuse-Zentrum für Informationstechnik Berlin, Heilbronner Str. 10, Berlin, Germany, 1992.Google Scholar
  4. [St091]
    M. Stoer. Design of survivable networks. PhD thesis, University of Augsburg, 1991. To appear in Lecture Notes in Mathematics, Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Mechthild Stoer
    • 1
  1. 1.Konrad-Zuse-Zentrum für Informationstechnik BerlinBerlin 31Germany

Personalised recommendations