Travelling-salesman-problem-algorithm
于 2013-12-30 发布
文件大小:2KB
0 221
下载积分: 1
下载次数: 2
代码说明：
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.
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
