文件名称:lvxingshangwenti
介绍说明－－下载内容均来自于网络，请自行研究使用
设有n+1个城市，分别用0,1,...,n表示。从从城市i到城市j的距离为d[i][j]。一个
推销员要从城市0出发，到达其他任意一城市一次且仅一次，然后再回到城市0。问题是
他如何选择行走路线，使总路程最短-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
推销员要从城市0出发，到达其他任意一城市一次且仅一次，然后再回到城市0。问题是
他如何选择行走路线，使总路程最短-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
旅行商问题.txt