Advertisement

© 2012

Combinatorial Optimization

Theory and Algorithms

Textbook

Part of the Algorithms and Combinatorics book series (AC, volume 21)

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Bernhard Korte, Jens Vygen
    Pages 1-12
  3. Bernhard Korte, Jens Vygen
    Pages 13-49
  4. Bernhard Korte, Jens Vygen
    Pages 51-71
  5. Bernhard Korte, Jens Vygen
    Pages 73-99
  6. Bernhard Korte, Jens Vygen
    Pages 101-129
  7. Bernhard Korte, Jens Vygen
    Pages 131-155
  8. Bernhard Korte, Jens Vygen
    Pages 157-171
  9. Bernhard Korte, Jens Vygen
    Pages 173-209
  10. Bernhard Korte, Jens Vygen
    Pages 211-239
  11. Bernhard Korte, Jens Vygen
    Pages 241-271
  12. Bernhard Korte, Jens Vygen
    Pages 273-299
  13. Bernhard Korte, Jens Vygen
    Pages 301-320
  14. Bernhard Korte, Jens Vygen
    Pages 321-353
  15. Bernhard Korte, Jens Vygen
    Pages 355-375
  16. Bernhard Korte, Jens Vygen
    Pages 377-412
  17. Bernhard Korte, Jens Vygen
    Pages 413-457
  18. Bernhard Korte, Jens Vygen
    Pages 459-470
  19. Bernhard Korte, Jens Vygen
    Pages 471-488
  20. Bernhard Korte, Jens Vygen
    Pages 489-520

About this book

Introduction

This 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

Keywords

combinatorial optimization discrete algorithms mathematical programming

Authors and affiliations

  1. 1.Forschungsinstitut für, Diskrete MathematikUniversität BonnBonnGermany
  2. 2.Forschungsinstitut für, Diskrete MathematikUniversität BonnBonnGermany

Bibliographic information

Reviews

From the reviews of the fifth edition:

“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises … . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)

“This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way.  … ‘Combinatorial Optimization’ can easily serve as … complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)