搜索资源列表
货郎担问题四种解法
- 货郎担问题的回溯，枚举，分支界限，动态规划解法-back the traveling salesman problem, except, branch line, dynamic programming solution
分支界限法求解货郎担问题
- 研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
货郎担问题源代码
- 货郎担问题源代码 货郎担问题源代码-traveling salesman problem source code traveling salesman problem
分支界限法求解货郎担问题
- 研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
apply
- 货郎担问题！这是用动态规划实现的！ 效率很高啊！-traveling salesman problem! This is achieved using dynamic programming! High efficiency ah!
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
货郎担问题源代码
- 货郎担问题源代码 货郎担问题源代码-traveling salesman problem source code traveling salesman problem
TSP和野人过河
- 货郎担问题和野人过河问题，解压后有word文档，里面有详细说明-traveling salesman problem and savage river, unpacked a word document, containing details
aiwa
- TSP问题（货郎担问题，旅行商问题）的模拟退火算法通用malab源程序-Traveling Salesman Problem (TSP, the traveling salesman problem), simulated annealing algorithm common source malab
货郎担问题四种解法
- 货郎担问题的回溯，枚举，分支界限，动态规划解法-back the traveling salesman problem, except, branch line, dynamic programming solution
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
TSPNEW
- 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast!
tsp
- 是一个模拟退火程序,解决的是货郎担问题,所用的语言是matlab -is a simulated annealing procedures to solve the traveling salesman problem is that the language used is Matlab
hldwt
- 货郎担问题,很详细的分析，初学者可以参考着-Traveling salesman problem, a very detailed analysis, beginners can refer to a
TSPgenerationwithMatlab
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序,可用于解决夺目的地TSP问题-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab general procedures can be used to solve TSP problems capture
TSP
- 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
huolangdanwenti
- 货郎担问题算法和程序，包括限界算法，和分支限界图形演示，绝对能执行-Traveling salesman problem algorithms and procedures, including Bound algorithm, and branch and bound graphical presentation is absolutely able to perform
fzjx
- 货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35
TSP
- 利用动态规划思想，求货郎担问题，采用C++，显示各结点的路径并求出最短距离-The use of dynamic programming ideas, seeking traveling salesman problem, using C++, showing the node' s path and find the shortest distance