Description: With n+1 cities, respectively 0,1 ,..., n, said. From from city i to city j, the distance d [i] [j]. A salesman from the city 0 departure, arriving in other cities in any one time and only once, and then back to city 0. The question is how he would choose the route, bringing the total shortest distance
To Search:
File list (Check if you may need any files):
旅行商问题.txt
Download