3 options
Design of Survivable Networks / by Mechthild Stoer.
Connect to full text Available online
View onlineMath/Physics/Astronomy Library QA3 .L28 v.1-999 470,523,830,849:2nd ed. v.1000-1722,1762,1781,1799-2099,2100-2218 2219-2223-2258,2260-2271,2273-2274-2277,2279-2281,2283-2289,2291,2293-2294,2296,2298-2299,2300-2311,2313-2379,2380-2384 2385-2389,2392
Mixed Availability
LIBRA QA3 .L28 Scattered vols.
Mixed Availability
- Format:
- Book
- Author/Creator:
- Stoer, Mechthild, 1963- author.
- Series:
- Lecture Notes in Mathematics, 0075-8434 ; 1531.
- Lecture Notes in Mathematics, 0075-8434 ; 1531
- Language:
- English
- Subjects (All):
- Engineering mathematics.
- Computer science.
- Distribution (Probability theory).
- System theory.
- Mathematical optimization.
- Chemistry--Mathematics.
- Chemistry.
- 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.
- Local Subjects:
- 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.
- Physical Description:
- 1 online resource (204 pages).
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992.
- System Details:
- text file PDF
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 9783540475002
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.