Skip to main content
SpringerLink
Log in

Design of Survivable Networks

  • Book
  • © 1992

Overview

Authors:
  1. Mechthild Stoer
    View author publications

    You can also search for this author in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages I-3
    Download chapter PDF

  2. Motivation

    • Mechthild Stoer
    Pages 5-6

  3. Network survivability models using node types

    • Mechthild Stoer
    Pages 7-18

  4. Survivable network design under connectivity constraints — a survey

    • Mechthild Stoer
    Pages 19-32

  5. Decomposition

    • Mechthild Stoer
    Pages 33-47

  6. Basic inequalities

    • Mechthild Stoer
    Pages 49-68

  7. Lifting theorems

    • Mechthild Stoer
    Pages 69-76

  8. Partition inequalities

    • Mechthild Stoer
    Pages 77-90

  9. Node partition inequalities

    • Mechthild Stoer
    Pages 91-99

  10. Lifted r-cover inequalities

    • Mechthild Stoer
    Pages 101-112

  11. Comb inequalities

    • Mechthild Stoer
    Pages 113-123

  12. How to find valid inequalities

    • Mechthild Stoer
    Pages 125-154

  13. Implementation of the cutting plane algorithm

    • Mechthild Stoer
    Pages 155-173

  14. Computational results

    • Mechthild Stoer
    Pages 175-194

  15. Back Matter

    Pages 196-205
    Download chapter PDF
Back to top

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation