Description: Known n city between the distance, the existing of a salesman to be visited this n city, and each city can only be visited once, finally to return to the starting city. How to arrange for him to visit the city order, which can make the total length of the shortest travel route
To Search:
File list (Check if you may need any files):
mat.a TSP .doc
Download