Combinatorial Optimization

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.
TOC: Preface.- 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.- Subject Index