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.

Keywords

Bibliographic Information

Book Title: Design of Survivable Networks
Authors: Mechthild Stoer
Series Title: Lecture Notes in Mathematics
DOI: https://doi.org/10.1007/BFb0088963
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1992
Softcover ISBN: 978-3-540-56271-9Published: 14 December 1992
eBook ISBN: 978-3-540-47500-2Published: 15 November 2006
Series ISSN: 0075-8434
Series E-ISSN: 1617-9692
Edition Number: 1
Number of Pages: 204
Topics: Mathematical and Computational Engineering, Mathematics of Computing, Probability Theory and Stochastic Processes, Systems Theory, Control, Calculus of Variations and Optimal Control; Optimization, Math. Applications in Chemistry

Publish with us

Policies and ethics

Authors:

Sections

Buy it now

Buying options

Other ways to access

Table of contents (13 chapters)

Front Matter

Back Matter

About this book