搜索资源列表
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
tsp_tsp
- 中国所有大中城市的TSP问题实现。图形演示。采用最近邻法则-all of China's large and medium-sized cities in the TSP to achieve. Presentation graphics. Neighbors recently adopted rules
2003011514-TSP
- 旅行商问题问题的二叉树求解方法，基于命令行参数的，-Traveling Salesman Problem Solving the problem of binary tree method, based on the command line parameters,
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after
tsp
- 用C语言实现旅行商问题。该算法简单精悍，效率也不低，是实现TSP问题的很好的算法。
TSP
- 用C++实现了解决6*6矩阵的TSP问题!!!含有源代码!
TSP-MST.rar
- 最小生成树的思想应用于TSP问题的求解，贪心算法的实际应用。,Minimum Spanning Tree thinking applied to TSP problem solving, the practical application of greedy algorithm.
02666199TS-TSP
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, the shortest distance
tsp
- 旅行商问题， 旅行商问题，旅行商问题。-Traveling salesman problem, traveling salesman problem, traveling salesman problem.
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
TSP
- 介绍了一下著名的TSP问题，旅行商问题，提出了几种解法。-Introduction about the well-known TSP problem, traveling salesman problem, proposed several solutions.
TSP
- 一些小程序,有关于TSP问题的代码，这是数据结构老师安排的作业-Small programs, the code on the TSP problem, which is a scheduled job data structure teacher
tsp
- 用蚁群算法解决TSP问题，快速便捷而且很全面，比较谨慎-Ant colony algorithm to solve TSP, quick and easy and very comprehensive, more cautious
TSP
- 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, r
TSP
- 旅行商问题的部分资料，有参考的价值。TSP问题，遗传算法-Some information on the traveling salesman problem, a reference value. TSP problem, genetic algorithm
tsp
- 关于旅行商问题求解最短路径的程序设计，本程序很好解决TSP问题的算法-About Traveling Salesman Problem solving the shortest path programming, this program is a good algorithm to solve TSP problem
TSP.matlab
- 基于遗传算法解决TSP问题，matlab，可以实现-Based on the genetic algorithm to solve TSP problem
TSP-PROBLEM
- C99标准实现的动态规划法和分支定界法解决TSP问题-Dynamic Programming Method and Brand-and-Bound Method Solving TSP Problem Under C99 Standard