00836nam0-2200277 --450 991029155880332120190925115020.0978-88-7433-963-120181113d2014----kmuy0itay5050 baitaITy 001yy<<Una >>"scrittura celeste": avvicinamenti ad Anna Maria OrteseFrancesca FavaroPescaraTracce201486 p.21 cm<<Le >>orme del tempoOrtese, Anna Maria <1914-1998>853.91422itaFavaro,Francesca224029ITUNINAREICATUNIMARCBK9910291558803321853.914 ORTE/S 5bibl. 2019FLFBCFLFBCScrittura celeste: avvicinamenti ad Anna Maria Ortese1537566UNINA03007nam 2200637 450 99646658710331620220907190850.03-540-47500-110.1007/BFb0088963(CKB)1000000000437131(SSID)ssj0000322540(PQKBManifestationID)12131932(PQKBTitleCode)TC0000322540(PQKBWorkID)10283688(PQKB)11307873(DE-He213)978-3-540-47500-2(MiAaPQ)EBC5585699(Au-PeEL)EBL5585699(OCoLC)1066180652(MiAaPQ)EBC6842115(Au-PeEL)EBL6842115(OCoLC)1058160002(PPN)155221698(EXLCZ)99100000000043713120220907d1992 uy 0engurnn|008mamaatxtccrDesign of survivable networks /Mechthild Stoer1st ed. 1992.Berlin :Springer-Verlag,[1992]©19921 online resource (204 p.) Lecture notes in mathematics (Springer-Verlag) ;1531Bibliographic Level Mode of Issuance: Monograph3-540-56271-0 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.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.Lecture notes in mathematics (Springer-Verlag) ;1531.Computer networksDesign and constructionGraph theoryProgramming (Mathematics)Computer networksDesign and construction.Graph theory.Programming (Mathematics)004.6Stoer Mechthild1963-60361MiAaPQMiAaPQMiAaPQBOOK996466587103316Design of survivable networks376377UNISA