|
![]() |
|||
|
||||
OverviewThe 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. Full Product DetailsAuthor: Peter J FlorianiPublisher: Habitation of Chimham Publishing Imprint: Habitation of Chimham Publishing Dimensions: Width: 15.20cm , Height: 0.60cm , Length: 22.90cm Weight: 0.168kg ISBN: 9780989969635ISBN 10: 0989969630 Pages: 118 Publication Date: 30 April 2016 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |