Design of survivable networks /
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 i...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
[1992]
|
| Series: | Lecture notes in mathematics (Springer-Verlag) ;
1531. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| 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. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (204 pages) : illustrations. |
| Format: | 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. |
| Bibliography: | Includes bibliographical references (pages [197]-204) and index. |
| ISBN: | 9783540475002 (electronic bk.) 3540475001 (electronic bk.) |
| ISSN: | 0075-8434 ; |