文件名称: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
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。