Design of survivable networks /
Saved in:
| Author / Creator: | Stoer, Mechthild, 1963- |
|---|---|
| Imprint: | Berlin ; New York : Springer-Verlag, c1992. |
| Description: | 204 p. : ill. ; 25 cm. |
| Language: | English |
| Series: | Lecture notes in mathematics ; 1531 Lecture notes in mathematics (Springer-Verlag) 1531. |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1440159 |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | 1440159 | ||
| 003 | ICU | ||
| 005 | 19970809110100.0 | ||
| 008 | 930315s1992 gw a b 001 0 eng | ||
| 010 | |a 92039266 | ||
| 020 | |a 3540562710 (Berlin : alk. paper) : |c DM52.00 | ||
| 020 | |a 0387562710 (New York : alk. paper) | ||
| 035 | |a (ICU)BID16850336 | ||
| 035 | |a (OCoLC)26973836 | ||
| 040 | |c DLC |d DLC$dOrLoB | ||
| 050 | 0 | 0 | |a TK5105.5 |b .S75 1992 |
| 082 | |a 519.7 |2 20 | ||
| 100 | 1 | |a Stoer, Mechthild, |d 1963- |0 http://id.loc.gov/authorities/names/n92103059 |1 http://viaf.org/viaf/112843176 | |
| 245 | 1 | 0 | |a Design of survivable networks / |c Mechthild Stoer. |
| 260 | |a Berlin ; |a New York : |b Springer-Verlag, |c c1992. | ||
| 300 | |a 204 p. : |b ill. ; |c 25 cm. | ||
| 336 | |a text |b txt |2 rdacontent |0 http://id.loc.gov/vocabulary/contentTypes/txt | ||
| 337 | |a unmediated |b n |2 rdamedia |0 http://id.loc.gov/vocabulary/mediaTypes/n | ||
| 338 | |a volume |b nc |2 rdacarrier |0 http://id.loc.gov/vocabulary/carriers/nc | ||
| 490 | 1 | |a Lecture notes in mathematics ; |v 1531 | |
| 504 | |a Includes bibliographical references (p. [197]-204) and index. | ||
| 505 | 0 | 0 | |g 1. |t Motivation -- |g 2. |t Network Survivability Models Using Node Types. |g 2.1. |t Survivable Telephone Networks. |g 2.2. |t Graph-theoretic Formulation. |g 2.3. |t Integer LP-Formulation and Associated Polyhedra. |g 2.4. |t An Outline of the Cutting Plane Procedure. |g 2.5. |t Outlook on the Contents -- |g 3. |t Survivable Network Design under Connectivity Constraints - a Survey. |g 3.1. |t Polynomially Solvable Cases. |g 3.2. |t Results for Restricted Costs. |g 3.3. |t Heuristics for General Costs. |g 3.4. |t Exact Algorithms for General Costs -- |g 4. |t Decomposition. |g 4.1. |t Bridges, Articulation Nodes, and Paths. |g 4.2. |t Articulation Sets of Size 2 for 2NCON. |g 4.3. |t Articulation Sets of Size 2 for 1ECON. |g 4.4. |t Cutsets of Size 3 for 2CON. |g 4.5. |t Cutsets of Size k for kCON -- |g 5. |t Basic Inequalities. |g 5.1. |t Dimension and Trivial Inequalities. |g 5.2. |t Cut Constraints for Low-Connectivity. |g 5.3. |t Cut Constraints for kECON. |g 5.4. |t Node Cut Constraints for 2NCON. |g 5.5. |t (Node) Cut Constraints for kNCON -- |g 6. |t Lifting Theorems. |g 6.1. |t Expansion of Nodes. |g 6.2. |t Addition of Edges. |g 6.3. |t Addition of Nodes of Type 1 -- |g 7. |t Partition Inequalities. |g 7.1. |t Motivation. |g 7.2. |t Facet Results for kECON. |g 7.3. |t Facet Results for kNCON. |g 7.4. |t Facet Results for Low Connectivity -- |g 8. |t Node Partition Inequalities. |g 8.1. |t Generalization of Node Cut Constraints. |g 8.2. |t Validity. |g 8.3. |t Facet Results -- |g 9. |t Lifted r-Cover Inequalities. |g 9.1. |t Motivation. |g 9.2. |t r-Cover Inequalities. |g 9.3. |t Lifted r-Cover Inequalities -- |g 10. |t Comb Inequalities. |g 10.1. |t Comb Inequalities for 2NCON. |g 10.2. |t Comb Inequalities for kNCON. |g 10.3. |t Comb Inequalities for 2ECON -- |g 11. |t How to Find Valid Inequalities. |g 11.1. |t Related Polyhedra. |g 11.1.1. |t Special Cases. |g 11.1.2. |t Relaxation. |g 11.1.3. |t Subfaces. |g 11.1.4. |t Projection and Prodon Inequalities. |g 11.2. |t Small Polyhedra. |g 11.3. |t Generalization of Validity Proofs. |g 11.4. |t Fractional Solutions. |g 11.5. |t Redundant Inequalities. |g 11.5.1. |t Little-Man Inequalities. |g 11.6. |t Open Problems -- |g 12. |t Implementation of the Cutting Plane Algorithm. |g 12.1. |t The Framework. |g 12.2. |t Complexity of the Separation Problems. |g 12.3. |t Separating Partition Inequalities. |g 12.3.1. |t Transforming Cuts into Partitions. |g 12.3.2. |t Shrinking Criteria for Partition Inequalities. |g 12.4. |t Separating Node Partition Inequalities. |g 12.5. |t Separating Lifted r-Cover Inequalities. |g 12.5.1. |t Shrinking One-Paths. |g 12.5.2. |t The Padberg-Rao Algorithm. |g 12.5.3. |t Converting H, T into a Lifted r-Cover Constraint. |g 12.6. |t Other Details -- |g 13. |t Computational Results. |g 13.1. |t Low-Connectivity Problems. |g 13.2. |t High-Connectivity Problems. |g 13.2.1. |t Random Problems. |g 13.2.2. |t The Ship Problem. |
| 650 | 0 | |a Computer networks |x Design and construction. |0 http://id.loc.gov/authorities/subjects/sh2009121222 | |
| 650 | 0 | |a Computer networks |x Mathematical models. | |
| 650 | 7 | |a Computer networks |x Design and construction. |2 fast |0 http://id.worldcat.org/fast/fst00872309 | |
| 650 | 7 | |a Computer networks |x Mathematical models. |2 fast |0 http://id.worldcat.org/fast/fst00872326 | |
| 830 | 0 | |a Lecture notes in mathematics (Springer-Verlag) |v 1531. |0 http://id.loc.gov/authorities/names/n42015165 | |
| 850 | |a ICU | ||
| 901 | |a ToCBNA | ||
| 903 | |a HeVa | ||
| 903 | |a Hathi | ||
| 929 | |a cat | ||
| 999 | f | f | |i 61e0e0b5-15fa-5eaa-817b-f4d323e0090c |s cbdfc025-17d3-5ba3-9344-87a1fff1224f |
| 928 | |t Library of Congress classification |a TK5105.5.S750 1992 |l ASR |c ASR-SciASR |i 2734473 | ||
| 927 | |t Library of Congress classification |a TK5105.5.S750 1992 |l ASR |c ASR-SciASR |e CRERAR |b 38756764 |i 2813089 | ||
