Amazon cover image
Image from Amazon.com

Design of survivable networks / Mechthild Stoer.

By: Material type: TextTextSeries: Lecture notes in mathematics (Springer-Verlag) ; 1531.Publication details: Berlin ; New York : Springer-Verlag, ©1992.Description: 1 online resource (204 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540475002
  • 3540475001
Subject(s): Additional physical formats: Print version:: Design of survivable networks.DDC classification:
  • 519.7 20
LOC classification:
  • TK5105.5 .S75 1992
Other classification:
  • 85.03
  • *90C27
  • 90B18
  • 90C10
  • 27
Online resources:
Contents:
Motivation -- Network survivability models using node types -- Survivable network design under connectivity constraints -- 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.
Action note:
  • digitized 2010 HathiTrust Digital Library committed to preserve
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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LN Mathematic Available
Total holds: 0

Includes bibliographical references (pages 197-204) and index.

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

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. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

Motivation -- Network survivability models using node types -- Survivable network design under connectivity constraints -- 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.

Powered by Koha