04657nam a22006135i 4500 978-3-540-71844-4 DE-He213 20210615163435.0 cr nn 008mamaa 100301s2008 gw | s |||| 0|eng d 9783540718444 978-3-540-71844-4 10.1007/978-3-540-71844-4 doi QA150-272 PBD bicssc MAT008000 bisacsh PBD thema 511.1 23 Korte, Bernhard. author. aut http://id.loc.gov/vocabulary/relators/aut Combinatorial Optimization [electronic resource] : Theory and Algorithms / by Bernhard Korte, Jens Vygen. 4th ed. 2008. Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008. XVIII, 627 p. 77 illus. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Algorithms and Combinatorics, 0937-5511 Graphs -- Linear Programming -- Linear Programming Algorithms -- Integer Programming -- Spanning Trees and Arborescences -- Shortest Paths -- Network Flows -- Minimum Cost Flows -- Maximum Matchings -- Weighted Matching -- b-Matchings and T-Joins -- Matroids -- Generalizations of Matroids -- NP-Completeness -- Approximation Algorithms -- The Knapsack Problem -- Bin-Packing -- Multicommodity Flows and Edge-Disjoint Paths -- Network Design Problems -- The Traveling Salesman Problem -- Facility Location. This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. 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), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054. Discrete mathematics. Mathematical models. Combinatorics. Calculus of variations. Computer science—Mathematics. Operations research. Decision making. Discrete Mathematics. https://scigraph.springernature.com/ontologies/product-market-codes/M29000 Mathematical Modeling and Industrial Mathematics. https://scigraph.springernature.com/ontologies/product-market-codes/M14068 Combinatorics. https://scigraph.springernature.com/ontologies/product-market-codes/M29010 Calculus of Variations and Optimal Control; Optimization. https://scigraph.springernature.com/ontologies/product-market-codes/M26016 Mathematics of Computing. https://scigraph.springernature.com/ontologies/product-market-codes/I17001 Operations Research/Decision Theory. https://scigraph.springernature.com/ontologies/product-market-codes/521000 Vygen, Jens. author. aut http://id.loc.gov/vocabulary/relators/aut SpringerLink (Online service) Springer Nature eBook Printed edition: 9783540837206 Printed edition: 9783642090929 Printed edition: 9783540718437 Algorithms and Combinatorics, 0937-5511 https://doi.org/10.1007/978-3-540-71844-4 ZDB-2-SMA ZDB-2-SXMS Mathematics and Statistics (SpringerNature-11649) Mathematics and Statistics (R0) (SpringerNature-43713)