|  | Authors: Christos H. Papadimitriou, Kenneth Steiglitz
Publisher: Dover Publications
List Price: $19.95
Buy New: $11.98
as of 3/18/2010 16:13 CDT details
You Save: $7.97 (40%)
New (27) Used (12) from $7.00
Seller: pbshop
Rating:  17 reviews
Sales Rank: 58054
Format: Unabridged
Languages: English (Original Language), English (Unknown), English (Published)
Media: Paperback
Edition: Unabridged
Pages: 512
Number Of Items: 1
Shipping Weight (lbs): 1.2
Dimensions (in): 8.4 x 5.3 x 1
ISBN: 0486402584
Dewey Decimal Number: 519.3
EAN: 9780486402581
ASIN: 0486402584
Publication Date: January 29, 1998
Availability: Usually ships in 1-2 business days
Condition: Brand new book! Delivered direct from our US warehouse by Expedited (4-7 days) or Standard (usually 10-14 days but can be longer). Expedited shipping recommended for speedier delivery. Over 1 million satisfied customers
|
| Customer Reviews:
Showing reviews 6-10 of 17
 a great bargain April 17, 2006
J. Ye (Boston, MA)
3 out of 3 found this review helpful
It is my favorite book on combinatorial optimization. The last 5 chapters 15-19 are the most interesting and useful to me because my job is write heuristics for NP hard problems in transportation. Chatpers 15 and 16 on NP complete problems are well explained and covered in depth. Chapter 17 on approximation algorithms is easy to understand and fun to read. Chapters 18 (branch-and-bound and dynamic programming) and 19 (local search) are very practical stuff, which I read many times.
The rest of the book is a good reference for topics like linear programming, max-flow, matching, etc. There are mostly independent of the last 5 chapters and can be skipped on a first read. My experience is that I don't need detailed knowledge of simplex algorithms because I use CPlex.
Well written and accessible March 29, 2006
Hernadvolgyi Istvan (Hungary - Canada)
3 out of 3 found this review helpful
A couple of years ago I used this book to prepare for my PhD comprehensive exam and recently I picked it up again. While a lot has happened in OR since the book was written, the basics are covered in fine detail and in beautiful style. It could also be used as a graduate textbook or a course supplement. A very useful book for anyone interested in combinatorial optimization. What missing is the wealth of Artificial Intelligence techniques successfully used to tackle NP-hard optimization problems. But this is not a negative comment, just for your information. That belongs to another book. Linear Programming, Duality, Spanning Trees, Flows, Matching and introduction into NP-completeness are finely covered. A truly great job for an amazingly low price (see the text book prices with similar titles).
 It was Good!! March 21, 2006
S. Lee
2 out of 8 found this review helpful
This is a Good Book for whom want to learn the concept of combinatorial Optimaization.
The only disadvantage is that there is no solution manual for excercises.
So, I couldn't check if my answer was right or not.
 Combinatorial Optimization September 13, 2005
John R. Beatty (Edmonton, AB, Canada)
2 out of 76 found this review helpful
This is a book for mathematic nerds. There are no practical analytical problems in the book to make it useful for those of us involved in quick solutions to solve problems such as payoffs for investments beginning with forces of nature and then going through probability factors to get to real numbers of what can happen to various investment opportunities.
I did recognize the value of the book for those who are on the front lines of determining how many and where ISPs might be on a route from Edmonton to Washington but one can use other methods of project controls. The math in this book was of no value --- even a wee bit.
When I came across the TSP or Travelling Salesman Problem, it reminded me of how I used to name physics problems for students. But, I always thought the TSP was really the Farmer's Daughter problem. Apparently it ain't so.
JR.
A masterpiece December 7, 2004
Wagner F. Sacco (Atlanta, GA)
4 out of 5 found this review helpful
This book is a classic. Besides, it's a bargain. I read it more than 10 years ago as an undergrad and, even then, could grasp all the concepts. So, it's really accessible.
Showing reviews 6-10 of 17
|
|
|
