Jump to ratings and reviews
Rate this book

Combinatorial Optimization: Theory and Algorithms

Rate this book
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.

580 pages, Hardcover

First published April 29, 2002

8 people are currently reading
78 people want to read

About the author

Bernhard Korte

16 books1 follower
Bernhard H. Korte was a German computer scientist, a professor at the University of Bonn, and an expert in combinatorial optimization.

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
8 (44%)
4 stars
7 (38%)
3 stars
3 (16%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.