000 | 03594nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-47500-2 | ||
003 | DE-He213 | ||
005 | 20190213151756.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1992 gw | s |||| 0|eng d | ||
020 |
_a9783540475002 _9978-3-540-47500-2 |
||
024 | 7 |
_a10.1007/BFb0088963 _2doi |
|
050 | 4 | _aTA329-348 | |
050 | 4 | _aTA640-643 | |
072 | 7 |
_aTBJ _2bicssc |
|
072 | 7 |
_aMAT003000 _2bisacsh |
|
072 | 7 |
_aTBJ _2thema |
|
082 | 0 | 4 |
_a519 _223 |
100 | 1 |
_aStoer, Mechthild. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aDesign of Survivable Networks _h[electronic resource] / _cby Mechthild Stoer. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1992. |
|
300 |
_a204 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1531 |
|
505 | 0 | _aMotivation -- 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. | |
520 | _aThe 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. | ||
650 | 0 | _aEngineering mathematics. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aDistribution (Probability theory. | |
650 | 0 | _aSystems theory. | |
650 | 0 | _aMathematical optimization. | |
650 | 0 |
_aChemistry _xMathematics. |
|
650 | 1 | 4 |
_aMathematical and Computational Engineering. _0http://scigraph.springernature.com/things/product-market-codes/T11006 |
650 | 2 | 4 |
_aMathematics of Computing. _0http://scigraph.springernature.com/things/product-market-codes/I17001 |
650 | 2 | 4 |
_aProbability Theory and Stochastic Processes. _0http://scigraph.springernature.com/things/product-market-codes/M27004 |
650 | 2 | 4 |
_aSystems Theory, Control. _0http://scigraph.springernature.com/things/product-market-codes/M13070 |
650 | 2 | 4 |
_aCalculus of Variations and Optimal Control; Optimization. _0http://scigraph.springernature.com/things/product-market-codes/M26016 |
650 | 2 | 4 |
_aMath. Applications in Chemistry. _0http://scigraph.springernature.com/things/product-market-codes/C17004 |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662194188 |
776 | 0 | 8 |
_iPrinted edition: _z9783540562719 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1531 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0088963 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c11844 _d11844 |