000 03954nam a22005895i 4500
001 978-3-540-71844-4
003 DE-He213
005 20160302163605.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540718444
_9978-3-540-71844-4
024 7 _a10.1007/978-3-540-71844-4
_2doi
050 4 _aQA150-272
072 7 _aPBD
_2bicssc
072 7 _aMAT008000
_2bisacsh
082 0 4 _a511.1
_223
100 1 _aKorte, Bernhard.
_eauthor.
245 1 0 _aCombinatorial Optimization
_h[electronic resource] :
_bTheory and Algorithms /
_cby Bernhard Korte, Jens Vygen.
250 _aFourth Edition.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _aXVIII, 627 p. 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 _aGraphs -- 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.
520 _aThis 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.
650 0 _aMathematics.
650 0 _aOperations research.
650 0 _aDecision making.
650 0 _aComputer science
_xMathematics.
650 0 _aMathematical models.
650 0 _aCalculus of variations.
650 0 _aDiscrete mathematics.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aDiscrete Mathematics.
650 2 4 _aMathematical Modeling and Industrial Mathematics.
650 2 4 _aCombinatorics.
650 2 4 _aCalculus of Variations and Optimal Control; Optimization.
650 2 4 _aMathematics of Computing.
650 2 4 _aOperation Research/Decision Theory.
700 1 _aVygen, Jens.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540718437
830 0 _aAlgorithms and Combinatorics,
_x0937-5511 ;
_v21
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-71844-4
912 _aZDB-2-SMA
999 _c181554
_d181554