This comprehensive book on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books. Many recent topics are covered and important references are provided. Thus, this book represents the state-of-the-art in combinatorial optimization.

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

1. Introduction.- 2. Graphs.- 3. Linear Programming.- 4. Linear Programming Algorithms.- 5. Integer Programming.- 6. Spanning Trees and Arborescences.- 7. Shortest Paths.- 8. Network Flows.- 9. Minimum Cost Flows.- 10. Maximum Matchings.- 11. Weighted Matching.- 12. b-Matchings and T-Joins.- 13. Matroids.- 14. Generalizations of Matroids.- 15. NP-Completeness.- 16. Approximation Algorithms.- 17. The Knapsack Problem.- 18. Bin-Packing.- 19. Multicommodity Flows and Edge-Disjoint Paths.- 20. Network Design Problems.- 21. The Traveling Salesman Problem.- Notation Index.- Author Index.