Combinatorial Optimization

Theory and Algorithms

  • Bernhard Korte
  • Jens Vygen

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

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Pages 1-12
  3. Pages 13-47
  4. Pages 49-69
  5. Pages 99-126
  6. Pages 151-164
  7. Pages 165-197
  8. Pages 199-226
  9. Pages 227-256
  10. Pages 257-283
  11. Pages 285-303
  12. Pages 305-336
  13. Pages 359-392
  14. Pages 393-437
  15. Pages 439-448
  16. Pages 449-465
  17. Pages 491-525
  18. Pages 563-598
  19. Back Matter
    Pages 599-627

About this book


This 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


Combinatorial Optimization Mathematical Programming algorithms discrete algorithms linear optimization operations research optimization

Authors and affiliations

  • Bernhard Korte
    • 1
  • Jens Vygen
    • 1
  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Bibliographic information