000 04775cam a22005775i 4500
001 21681310
003 OSt
005 20220106022506.0
006 m |o d |
007 cr |||||||||||
008 180313s2018 gw |||| o |||| 0|eng
010 _a 2019747566
020 _a9783662560396
024 7 _a10.1007/978-3-662-56039-6
_2doi
035 _a(DE-He213)978-3-662-56039-6
040 _aDLC
_beng
_epn
_erda
_cDLC
072 7 _aMAT036000
_2bisacsh
072 7 _aPBV
_2bicssc
072 7 _aPBV
_2thema
082 0 4 _a511.6
_223
100 1 _aKorte, Bernhard.
_eauthor.
245 1 0 _aCombinatorial Optimization :
_bTheory and Algorithms /
_cby Bernhard Korte, Jens Vygen.
250 _a6th ed. 2018.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2018.
300 _a1 online resource (XXI, 698 pages 78 illustrations)
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aAlgorithms and Combinatorics,
_x0937-5511 ;
_v21
505 0 _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.
520 _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+E)-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 .
588 _aDescription based on publisher-supplied MARC data.
650 0 _aCalculus of variations.
650 0 _aCombinatorics.
650 0 _aComputer science-Mathematics.
650 0 _aDecision making.
650 0 _aOperations research.
650 1 4 _aCombinatorics.
_0https://scigraph.springernature.com/ontologies/product-market-codes/M29010
650 2 4 _aCalculus of Variations and Optimal Control; Optimization.
_0https://scigraph.springernature.com/ontologies/product-market-codes/M26016
650 2 4 _aMathematics of Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17001
650 2 4 _aOperations Research/Decision Theory.
_0https://scigraph.springernature.com/ontologies/product-market-codes/521000
700 1 _aVygen, Jens.
_eauthor.
776 0 8 _iPrint version:
_tCombinatorial optimization : theory and algorithms
_z9783662560389
_w(DLC) 2017958030
776 0 8 _iPrinted edition:
_z9783662560389
776 0 8 _iPrinted edition:
_z9783662560402
776 0 8 _iPrinted edition:
_z9783662585665
830 0 _aAlgorithms and Combinatorics,
_x0937-5511 ;
_v21
906 _a0
_bibc
_corigres
_du
_encip
_f20
_gy-gencatlg
942 _2ddc
_cBK
999 _c449292
_d449292