搜索资源列表
aglorithm
- 问题算法源代码:骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
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(货郎担)问题-This algorithm is the genetic algorithm is used to solve the TSP (traveling salesman) problems
MPI_C_TSP
- 在MPI平台下,用C语言实现模拟退火算法的货郎担问题的并行算法。-In the MPI platform, using C language to achieve simulated annealing algorithm traveling salesman problem of the parallel algorithm.
huolangdan
- 货郎担问题的程序,按照运行后出现的提示进行输出即可-Procedures for traveling salesman problem, in accordance with the operation after the output of the prompts can be
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 r
cvery_60718854
- 货郎担问题属于易于描述但难于解决的著名难题之一,至今世界上还有不少人在研究它。-TSP
Glzy8_6626_1152_ppt
- 这是一个关于用回溯法解决TSP问题的实际案例,此案例可以有效的家觉旅行售货员问题(货郎担问题)。-It is a retrospective method used to solve TSP practical cases, this case can be an effective home sleep travel salesman problem (traveling salesman problem).
saleman
- 货郎担问题,离散优化问题,快速处理离散的遍历问题-Traveling salesman problem, discrete optimization, rapid processing of discrete traversal problem
ant
- 旅行商问题(Travelling Salesman Problem, 简记TSP,亦称货郎担问题):设有n个城市和距离矩阵D=[dij],其中dij表示城市i到城市j的距离,i,j=1,2 … n,则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短-TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman
tsp
- 该程序解决10个城市的货郎担问题(TSP),主要使用简单的遗传算法实现。该过程中包括:编码、解码,选择,交叉,变异等!-The program to solve the traveling salesman problem of 10 cities (TSP), the use of simple genetic algorithm. The process includes: encoding, decoding, selection
a
- 货郎担问题: 求解货郎担问题的分枝限界算法-Traveling Salesman Problem
a
- 货郎担问题:求解货郎担问题的分枝限界算法-Traveling Salesman Problem: Solving the branch and bound algorithm for Traveling Salesman Problem
TSP
- 分支界限法解绝旅行商货郎担问题。
TSPMatlab
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序 f目标最优值,T最优路线,d距离矩阵,t0初始温度,tf结束温度 - TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序 f目标最优值,T最优路线,d距离矩阵,t0初始温度,tf结束温度
TSP
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序 f目标最优值,T最优路线,d距离矩阵,t0初始温度,tf结束温度 - TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序 f目标最优值,T最优路线,d距离矩阵,t0初始温度,tf结束温度
bbTSP
- 货郎担问题的分支界限算法,c++实现-Branch and bound algorithm for Traveling Salesman Problem, c++ implementation. . .
TSP
- A*算法实现货郎担问题,从外部文件读入数据然后进行搜索-A* algorithm for traveling salesman problem, the data read from an external file and then search
MNTH
- 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中,存在着大量的组合优化问题。例如,货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等,这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design