Description: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc Platform: |
Size: 9840 |
Author:yy |
Hits:
Description: 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category. Platform: |
Size: 2048 |
Author:赵刚 |
Hits:
Description: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc Platform: |
Size: 163840 |
Author:yy |
Hits:
Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path. Platform: |
Size: 4096 |
Author:bianbian |
Hits:
Description: Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change. Platform: |
Size: 135168 |
Author:黃文岩 |
Hits:
Description: 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes. Platform: |
Size: 886784 |
Author:吴男 |
Hits:
Description: 这是用Delphi编写的程序，目的是用TSP（分支限界法）实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem Platform: |
Size: 191488 |
Author:wen |
Hits:
Description: 本程序通过使用分支限界法实现旅行商问题，成功解决了旅行商问题-This procedure achieved by using the branch and bound traveling salesman problem, successfully solved the traveling salesman problem Platform: |
Size: 23552 |
Author:mhj |
Hits:
Description: TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt. Platform: |
Size: 194560 |
Author:sd |
Hits:
Search - TSP branch bound