000 04083nam a22005175i 4500
001 978-3-642-24488-9
003 DE-He213
005 20140220083303.0
007 cr nn 008mamaa
008 120109s2012 gw | s |||| 0|eng d
020 _a9783642244889
_9978-3-642-24488-9
024 7 _a10.1007/978-3-642-24488-9
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
100 1 _aKorte, Bernhard.
_eauthor.
245 1 0 _aCombinatorial Optimization
_h[electronic resource] :
_bTheory and Algorithms /
_cby Bernhard Korte, Jens Vygen.
250 _a5th ed. 2012.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2012.
300 _aXIX, 659p. 77 illus.
_bonline resource.
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 fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents 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 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) "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054  "...gives an excellent comprehensive view of the exciting field of combinatorial optimization."  Zentralblatt MATH 1149.90126
650 0 _aMathematics.
650 0 _aComputer science.
650 0 _aCombinatorics.
650 0 _aMathematical optimization.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aCalculus of Variations and Optimal Control; Optimization.
650 2 4 _aMathematics of Computing.
650 2 4 _aOperations Research/Decision Theory.
700 1 _aVygen, Jens.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642244872
830 0 _aAlgorithms and Combinatorics,
_x0937-5511 ;
_v21
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-24488-9
912 _aZDB-2-SMA
999 _c102290
_d102290