Design of Survivable Networks

  • Authors
  • Mechthild Stoer

Part of the Lecture Notes in Mathematics book series (LNM, volume 1531)

Table of contents

  1. Front Matter
    Pages I-3
  2. Mechthild Stoer
    Pages 5-6
  3. Mechthild Stoer
    Pages 33-47
  4. Mechthild Stoer
    Pages 49-68
  5. Mechthild Stoer
    Pages 69-76
  6. Mechthild Stoer
    Pages 77-90
  7. Mechthild Stoer
    Pages 91-99
  8. Mechthild Stoer
    Pages 101-112
  9. Mechthild Stoer
    Pages 113-123
  10. Mechthild Stoer
    Pages 125-154
  11. Mechthild Stoer
    Pages 155-173
  12. Mechthild Stoer
    Pages 175-194
  13. Back Matter
    Pages 196-205

About this book


The problem of designing a cost-efficient network that survives the failure of one or more nodes or edges of the network is critical to modern telecommunications engineering. The method developed in this book is designed to solve such problems to optimality. In particular, a cutting plane approach is described, based on polyhedral combinatorics, that is ableto solve real-world problems of this type in short computation time. These results are of interest for practitioners in the area of communication network design. The book is addressed especially to the combinatorial optimization community, but also to those who want to learn polyhedral methods. In addition, interesting new research problemsare formulated.


combinatorial optimization communication communications connectivity network design optimization polyhedral combinatorics

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56271-9
  • Online ISBN 978-3-540-47500-2
  • Series Print ISSN 0075-8434
  • Series Online ISSN 1617-9692
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Oil, Gas & Geosciences