搜索资源列表
Branchboundalgorithmtosolvthetravellingsalesmanpro
- 货郎担限界算法.c，货郎担分枝限界图形演示.c-traveling salesman Bound algorithm. C, traveling salesman Branch and Bound graphic demonstration. C
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
hldan
- 模拟退火算法求解货郎担问题（用C#实现）-simulated annealing algorithm for traveling salesman problem (with C#)
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
tsp(c)
- 简单模拟退火算法-货郎担问题.txt（c语言）-simple simulated annealing-traveling salesman problem. Txt (c language)
ga_and_tsp
- 这是一个用matlab编写的，关于如何用遗传算法来解决货郎担问题的程序-using Matlab, prepared on how to use genetic algorithms to solve the traveling salesman problem procedures
yichuan
- 本算法是遗传算法用于解决TSP(货郎担)问题
hldwt
- 货郎担问题,很详细的分析，初学者可以参考着
MPI_C_TSP
- 在MPI平台下，用C语言实现模拟退火算法的货郎担问题的并行算法。
Ason
- TSP货郎担过河问题，解压后有word文档
hld
- 算法设计中的。货郎担问题的实现。以成功检测运行
huolangdan
- 货郎担问题的程序,按照运行后出现的提示进行输出即可
huolangdan
- 货郎担问题的VC解法,寻找一条最优路径,实现遍历所有村庄的算法
货郎担算法(经过N个城市回到起点的最短路径)
- 经过N个城市回到起点的最短路径-cities to return to the starting point of the shortest path
apply
- 货郎担问题！这是用动态规划实现的！ 效率很高啊！-traveling salesman problem! This is achieved using dynamic programming! High efficiency ah!
tspapp
- 遗传算法和“货郎担” 问题: \"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and