搜索资源列表
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
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
货郎担问题四种解法
- 货郎担问题的回溯，枚举，分支界限，动态规划解法-back the traveling salesman problem, except, branch line, dynamic programming solution
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!
分支界限法求解货郎担问题
- 研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-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_ga
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab common procedures
SA_TSP
- 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities an
geneticTSP
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) Common genetic algorithm matlab program
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
遗传算法解决TSP问题的Matlab程序
- 解决TSP问题.TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序具体取值视问题的规模和耗费的时间而定(solve TSP problemSolve the TSP problem. The TSP problem (aka: travel salesman problem, freight forwarders) genetic algorithm general matlab program depends on the size of the problem and t
tsp_ga
- 适用于TSP问题。旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。(Apply to the TSP problem. The traveling salesman problem is one of the famous problems in the field of mathematics.)
main.cpp
- 实现推销员问题，算法作业，类似即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路……(To realize the problem of salesman)