Customer Reviews

Combinatorial Optimization

5 star:		(3)
4 star:		(1)
3 star:		(0)
2 star:		(0)
1 star:		(0)

 

 

Combinaorial Optimization is one of those rare books that is an instant classic. The authors weave a readable fabric of intuition and theory that is unmatched in this exciting discipline. The choice of topics covered begins with two fundamental optimization problems, namely, the minimum spanning tree and shortest path problems. Next, maximum flow and minimum cost flow problems are discussed, followed by matching problems, polyhedral issues arising in combinatorial optimization, and the famous traveling salesman problem. The text concludes with chapters on matroids and NP-Completeness. The exposition on these topics is very well written and the proofs are rigorous. There is a terrific blend of theory, algorithms and applications without overwhelming the reader with computational details. The authors also do a good job of developing an accurate historical perspective of the material, most of which evolved during the time period 1955 to 1995. The book is suitable for an upper-level undergraduate, or a graduate course. The exercises are very well thought out and are at an appropriate level. I have taught undergraduate courses in combinatorial optimization for over 10 years and have always struggled to find an appropriate text. My problem has now been solved.

This book was thoroughly written by great-minded Masters. It is well-organized in their topics and presentation. However, the book details is unbalnced, some chapters are overwhelm the data, and some others are insufficient. By the way, I graded this book a Very Good one. Worth Reading !!

A good introduction to Combinatorial optimisation and integer programming.

Especially recommended are the chapters on minimum weight matching and the TSP.

There is a crack in back cover which was not stated in description. content is fine so i dont mind