Design of survivable networks /

Design of survivable networks /

Saved in:

Bibliographic Details
Author / Creator:	Stoer, Mechthild, 1963-
Imprint:	Berlin ; New York : Springer-Verlag, ©1992.
Description:	1 online resource (204 pages) : illustrations.
Language:	English
Series:	Lecture notes in mathematics, 0075-8434 ; 1531 Lecture notes in mathematics (Springer-Verlag) ; 1531.
Subject:	Computer networks -- Design and construction. Computer networks -- Mathematical models. Computer networks -- Design and construction. Computer networks -- Mathematical models.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11070163

Hidden Bibliographic Details
ISBN:	9783540475002 3540475001 3540562710 9783540562719 0387562710 9780387562711
Notes:	Includes bibliographical references (pages 197-204) and index. Restrictions unspecified Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2010. Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 digitized 2010 HathiTrust Digital Library committed to preserve Print version record.
Summary:	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.
Other form:	Print version: Stoer, Mechthild, 1963- Design of survivable networks. Berlin ; New York : Springer-Verlag, ©1992 3540562710

Table of Contents:

Motivation
Network survivability models using node types
Survivable network design under connectivity constraints {u2014} a survey
Decomposition
Basic inequalities
Lifting theorems
Partition inequalities
Node partition inequalities
Lifted r-cover inequalities
Comb inequalities
How to find valid inequalities
Implementation of the cutting plane algorithm
Computational results.