» Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity Reviews

Customer Rating:
Summary: helpful and easy to read
Comment: I read the book and found it very helpful. It has a very excellent point of view and very easy to understand.

---

Customer Rating:
Summary: Excellent book!
Comment: This book is excellent. However, it's dense, so you'll have to read it carefully and never in a hurry.

---

Customer Rating:
Summary: Well written
Comment: I bought this book because I wanted to have theory on linear programming including duality, integer linear programming, typical graph algorithms and matroid theory in one book. Up to now I have read only most of the chapter on matroids and I would like to say a big thanks to the author.

Although you will not solve the world's problems with greedy algorithms, my mathematical part of the heart was pleased and satisfied by the theory which explained the very nice relation between matroids and greedy algorithms.

Maybe I will tell you more in a few months

---

Customer Rating:
Summary: Combinatorial Optimization: Algorithms and Complexity
Comment: The book's state is very good, so I am satisfied with it.

---

Customer Rating:
Summary: A classic...
Comment: I won't lie to you: this book is well written but relatively hard to read. The subject is inherently difficult, after all! I highly suggest it, though, because the author is a recognized expert on the field and the price is relatively low. It's worth it even if you enjoy a few pages...

---

More Reviews for Combinatorial Optimization: Algorithms and Complexity