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.

This 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