000 03641nam a22004815i 4500
001 978-3-540-29297-5
003 DE-He213
005 20161121231031.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540292975
_9978-3-540-29297-5
024 7 _a10.1007/3-540-29297-7
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
245 1 0 _aCombinatorial Optimization
_h[electronic resource] :
_bTheory and Algorithms.
250 _aThird Edition.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _aXVI, 597 p.
_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 21,
_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 puts 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. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book 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 third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. From the reviews of the 2nd edition: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Resarch 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 .
650 0 _aMathematics.
650 0 _aComputer science
_xMathematics.
650 0 _aCalculus of variations.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aCalculus of Variations and Optimal Control; Optimization.
650 2 4 _aMathematics of Computing.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540256847
830 0 _aAlgorithms and Combinatorics 21,
_x0937-5511 ;
_v21
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-29297-7
912 _aZDB-2-SMA
950 _aMathematics and Statistics (Springer-11649)
999 _c507580
_d507580