click to view more
Sometimes
by [Floriani, Peter J]
$20.03
Description
The famous Travelling Salesman Problem is easy to state: given a number of cities on a map, find the shortest path which visits each one and returns to the starting point. It's easy to write a program to solve it, but as the number of cities increases, it quickly becomes impossibly slow, even on modern computers. Why, then, would anyone try solving it hundreds of thousands of times? Maybe if someone did, we might learn something new about this famous problem, or about the even more famous question about P versus NP. Sometimes it's worth doing something foolish like that.
Last updated on
Product Details
- Habitation of Chimham Pub Brand
- Apr 30, 2016 Pub Date:
- 9780989969635 ISBN-13:
- 0989969630 ISBN-10:
- 118.0 pages Paperback
- English Language
- 9.02 in * 0.25 in * 5.98 in Dimensions:
- 0 lb Weight:
Money Back
Love it! Use it! Reuse it!
Free Shipping
Shipping is on us
Free Support
24/24 available
