文件名称:JSPzzj
介绍说明－－下载内容来自于网络，使用问题请自行百度
已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市
只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其
旅行路线的总长度最短？
-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to the city. How to arrange for him to visit these cities priorities, it can travel routes, the total length of the shortest?
只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其
旅行路线的总长度最短？
-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to the city. How to arrange for him to visit these cities priorities, it can travel routes, the total length of the shortest?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
gatsp.m
www.dssz.com.txt
www.dssz.com.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。