LEADER 01049nam0-22003251i-450 001 990005613980403321 005 20240723093558.0 035 $a000561398 035 $aFED01000561398 035 $a(Aleph)000561398FED01 035 $a000561398 100 $a19990604d1963----km-y0itay50------ba 101 0 $aita 105 $aa-------00--- 200 1 $aImagini delli dei de gl'antichi$fVincenzo Cartari$gEinleitung Walter Koschatzky vermehrt durch ein Inhaltsverzeichnis und neue Register 205 $aNachdruck der Ausgabe : Venedig, 1647 210 $aGraz$cAkademische Druck und Verlaganstalt$d1963 215 $aXLVIII, 400 p.$cill.$d26 cm 225 1 $aInstrumentaria artium$v1 610 0 $aMitologia classica 676 $a292.13 700 1$aCartari,$bVincenzo$0216617 702 1$aKoschatzky,$bWalter 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005613980403321 952 $a199.31 CARV 01$bST.ATE 12424$fFLFBC 959 $aFLFBC 996 $aImagini delli dei de gl'antichi$9603373 997 $aUNINA LEADER 05182nam 22007215 450 001 9910300110103321 005 20250407211817.0 010 $a9783662560396 010 $a3662560399 024 7 $a10.1007/978-3-662-56039-6 035 $a(CKB)4100000002892560 035 $a(DE-He213)978-3-662-56039-6 035 $a(MiAaPQ)EBC6314843 035 $a(MiAaPQ)EBC5592651 035 $a(Au-PeEL)EBL5592651 035 $a(OCoLC)1029053833 035 $a(PPN)225547759 035 $a(EXLCZ)994100000002892560 100 $a20180313d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Optimization $eTheory and Algorithms /$fby Bernhard Korte, Jens Vygen 205 $a6th ed. 2018. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2018. 215 $a1 online resource (XXI, 698 p. 78 illus.) 225 1 $aAlgorithms and Combinatorics,$x0937-5511 ;$v21 311 08$a9783662560389 311 08$a3662560380 320 $aIncludes bibliographical references and index. 327 $a1 Introduction -- 2 Graphs -- 3 Linear Programming -- 4 Linear Programming Algorithms -- 5 Integer Programming -- 6 Spanning Trees and Arborescences -- 7 Shortest Paths -- 8 Network Flows -- 9 Minimum Cost Flows -- 10 Maximum Matchings -- 11 Weighted Matching -- 12 b-Matchings and T -Joins -- 13 Matroids -- 14 Generalizations of Matroids -- 15 NP-Completeness -- 16 Approximation Algorithms -- 17 The Knapsack Problem -- 18 Bin-Packing -- 19 Multicommodity Flows and Edge-Disjoint Paths -- 20 Network Design Problems -- 21 The Traveling Salesman Problem -- 22 Facility Location -- Indices. 330 $aThis comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+?)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. From the reviews of the previous editions: ?This book on combinatorial optimization is a beautiful example of the ideal textbook.? Operations Research Letters 33 (2005) ?This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. ?Combinatorial Optimization? can easily serve as an (almost) complete reference for current research and is state-of-the-art. [?]? Zentralblatt MATH 1237.90001 . 410 0$aAlgorithms and Combinatorics,$x0937-5511 ;$v21 606 $aCombinatorial analysis 606 $aCalculus of variations 606 $aComputer science?Mathematics 606 $aOperations research 606 $aDecision making 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aCalculus of Variations and Optimal Control; Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26016 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aOperations Research/Decision Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/521000 615 0$aCombinatorial analysis. 615 0$aCalculus of variations. 615 0$aComputer science?Mathematics. 615 0$aOperations research. 615 0$aDecision making. 615 14$aCombinatorics. 615 24$aCalculus of Variations and Optimal Control; Optimization. 615 24$aMathematics of Computing. 615 24$aOperations Research/Decision Theory. 676 $a519.64 700 $aKorte$b B. H$g(Bernhard H.),$f1938-$4aut$4http://id.loc.gov/vocabulary/relators/aut$0110486 702 $aVygen$b Jens$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300110103321 996 $aCombinatorial Optimization$94349746 997 $aUNINA