Location:
Search - DP_TSP
Search list
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
最优路线是1,3,2,4,1，
其最短路程是25
Platform: |
Size: 13437 |
Author: zhengyy |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
Platform: |
Size: 6720 |
Author: 黄艺敏 |
Hits:
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
最优路线是1,3,2,4,1，
其最短路程是25
-Traveling Salesman Problem of a salesman to a number of cities to sell commodities, known distance between cities (or travel). Him to select a departure from the resident, through every city once again, and finally returned to the resident
Platform: |
Size: 274432 |
Author: zhengyy |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: |
Size: 1045504 |
Author: 黄艺敏 |
Hits:
Description: Dynamic Programming Code for the TSP
Platform: |
Size: 17408 |
Author: foxman |
Hits:
Description: 该程序是用动态规划方法解决旅行商问题，所用编程语言是C语言-The program is the dynamic programming method to solve the traveling salesman problem, the use of programming language is C language
Platform: |
Size: 17408 |
Author: 熊福力 |
Hits:
Description: Travelling Salesman Problem (TSP) with Dynamic Programming in C
Platform: |
Size: 17408 |
Author: MostafaSalehi
|
Hits: