The Travelling Salesman Problem
Edit Page
Report
Scan day: 09 February 2014 UTC
43
Virus safety - good
Description: Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases.
The Travelling Salesman Problem The Travelling Salesman Problem The travelling salesman problem consists in finding the shortest (or a nearly shortest) path connecting a number of locations (perhaps hundreds), such as cities visited by a travelling salesman on his sales route.
Size: 277 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | The Travelling Salesman Problem |
| Keywords: | travelling salesman problem, simulated annealing algorithm, computer simulation |
| Description: | Software illustrating, and implementing a solution to, the Travellng Salesman Problem. |
| IP-address: | 64.39.17.105 |
WHOIS Info
| NS | Name servers: adns3.easydns.com ns1.easydns.com |
| WHOIS | |
| Date |