文件名称:Travelling-salesman-problem-algorithm
-
所属分类：
- 标签属性：
- 上传时间：2013-12-30
-
文件大小：2.35kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Travelling salesman problem algorithm/Travelling salesman problem.m
Travelling salesman problem algorithm
Travelling salesman problem algorithm
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。