|
|||||||||||||||||||||||||||||||||||
|
1 Review
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
1 of 1 people found the following review helpful:
5.0 out of 5 stars
An excellent book for attempts to solve computationally intractable problems,
By Malay Dutta (Assam, India) - See all my reviews
This review is from: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) (Hardcover)
The question of existence of polynomial-time algorithms for hard problems now classified to be computationally intractable, is one of the most challenging open problems in Theoretical Computer Science. Even mathematicians has named it as one of the Millenium problems and have announced a 1 million dollar prize for one who solves it. This book with articles from several world-class experts who have tried to solve this problem or have obtained partial solutions, is an excellent reference book for someone who wants to enter this field or simply wants to gain some knowledge in this area.
|
|
Most Helpful First | Newest First
|
|
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) by D. B. Shmoys (Hardcover - Sept. 1985)
$465.00 $371.57
In Stock | |
 
| ||
