LEADER 03007nam 2200637 450 001 996466587103316 005 20220907190850.0 010 $a3-540-47500-1 024 7 $a10.1007/BFb0088963 035 $a(CKB)1000000000437131 035 $a(SSID)ssj0000322540 035 $a(PQKBManifestationID)12131932 035 $a(PQKBTitleCode)TC0000322540 035 $a(PQKBWorkID)10283688 035 $a(PQKB)11307873 035 $a(DE-He213)978-3-540-47500-2 035 $a(MiAaPQ)EBC5585699 035 $a(Au-PeEL)EBL5585699 035 $a(OCoLC)1066180652 035 $a(MiAaPQ)EBC6842115 035 $a(Au-PeEL)EBL6842115 035 $a(OCoLC)1058160002 035 $a(PPN)155221698 035 $a(EXLCZ)991000000000437131 100 $a20220907d1992 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDesign of survivable networks /$fMechthild Stoer 205 $a1st ed. 1992. 210 1$aBerlin :$cSpringer-Verlag,$d[1992] 210 4$dİ1992 215 $a1 online resource (204 p.) 225 1 $aLecture notes in mathematics (Springer-Verlag) ;$v1531 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56271-0 327 $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. 330 $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. 410 0$aLecture notes in mathematics (Springer-Verlag) ;$v1531. 606 $aComputer networks$xDesign and construction 606 $aGraph theory 606 $aProgramming (Mathematics) 615 0$aComputer networks$xDesign and construction. 615 0$aGraph theory. 615 0$aProgramming (Mathematics) 676 $a004.6 700 $aStoer$b Mechthild$f1963-$060361 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466587103316 996 $aDesign of survivable networks$9376377 997 $aUNISA