Combinatorial Optimization

Theory and Algorithms

Ranked #97 in Operations Research

This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and... more

Similar Books

If you like Combinatorial Optimization, check out these similar top-rated books:


Learn: What makes Shortform summaries the best in the world?