Ebook: Combinatorial Optimization: Theory and Algorithms

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

---

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

Content:
Front Matter....Pages I-XVII
Introduction....Pages 1-12
Graphs....Pages 13-47
Linear Programming....Pages 49-69
Linear Programming Algorithms....Pages 71-97
Integer Programming....Pages 99-126
Spanning Trees and Arborescences....Pages 127-149
Shortest Paths....Pages 151-164
Network Flows....Pages 165-197
Minimum Cost Flows....Pages 199-226
Maximum Matchings....Pages 227-256
Weighted Matching....Pages 257-283
Matroids....Pages 285-303
Generalizations of Matroids....Pages 305-336
Approximation Algorithms....Pages 337-357
The Knapsack Problem....Pages 359-392
Bin-Packing....Pages 393-437
Multicommodity Flows and Edge-Disjoint Paths....Pages 439-448
Network Design Problems....Pages 449-465
The Traveling Salesman Problem....Pages 467-489
Facility Location....Pages 491-525
Back Matter....Pages 527-562
....Pages 563-598