搜索资源列表
salesman-temp
- 货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path
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
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!
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
huolangdan
- 问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
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
hld
- 算法设计中的。货郎担问题的实现。以成功检测运行-Algorithm design. The realization of traveling salesman problem. To successfully detect running
huolangdan
- 货郎担问题的VC解法,寻找一条最优路径,实现遍历所有村庄的算法-Traveling salesman problem of the VC method, finding a optimal path to achieve all the villages traversal algorithm
HuoLang
- 货郎担 分支限界 的相关代码 共同共享-Traveling Salesman branch and bound together the relevant code-sharing
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.
huolangdan
- 一个简单的货郎担问题，用java语言实现-A simple traveling salesman problem, using java language
huolangdanwenti
- 货郎担问题算法和程序，包括限界算法，和分支限界图形演示，绝对能执行-Traveling salesman problem algorithms and procedures, including Bound algorithm, and branch and bound graphical presentation is absolutely able to perform
a
- 货郎担算法一直是C++领域一个经典的算法，该源代码通过四种方法对货郎担算法进行了求解。-Traveling salesman algorithm has been C++ are the field of a classical algorithm, the source code through the four methods for solving the traveling salesman algorithm.
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
TSP
- TSP问题（货郎担问题，旅行商问题）的模拟退火算法通用malab源程序-TSP problems (traveling salesman problem, traveling salesman problem) is common malab simulated annealing source code