Del i serien Algorithms and Combinatorics

Combinatorial Optimization

Theory and Algorithms

Häftad, Engelska, 2010

AvBernhard Korte,Jens Vygen

1 109 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (2)

Inbunden

1 389 kr

Skickas inom 10-15 vardagar

Häftad

969 kr

Skickas inom 10-15 vardagar

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided.

Produktinformation

Utgivningsdatum2010-11-11
Mått155 x 235 x 35 mm
Vikt966 g
FormatHäftad
SpråkEngelska
SerieAlgorithms and Combinatorics
Antal sidor627
Upplaga4
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642090929

Tillhör följande kategorier

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.

From the reviews of the 2nd Edition: "Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field."- MATHEMATICAL REVIEWS "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 From the reviews of the third edition: "In the last years Korte and J. Vygen's 'Combinational Optimization. Theory and Algorithms' has become a standard textbook in the field. 5 years after the first edition ... the 3rd revised edition is available. ... several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization." Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007 "This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. ... As befits a reference book, the references are very complete and up to date. ... The book has separate topic and author indexes and a very useful glossary of notation. ... The book ... will appeal primarily to readers who want an advanced textbook that can also serve as a concise reference. ... The current volume by Korte and Vygen is a worthy successor." Brian Borchers, MathDL, May, 2006