搜索资源列表
-
0下载：
货郎担限界算法.c，货郎担分枝限界图形演示.c-traveling salesman Bound algorithm. C, traveling salesman Branch and Bound graphic demonstration. C
-
-
0下载：
这是自己编写的matlab程序设计。
用来解决旅行商问题优化 。-This is, the preparation of the Matlab programming. To solve the traveling salesman problem optimization.
-
-
0下载：
问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
-
-
0下载：
问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
-
-
0下载：
图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
-
-
0下载：
研究旅行商问题过程中自己改写的Grefenstette编码、解码函数，附带小规模标准部分数据集,Grefenstette encoding and decoding function for Traveling salesman problem
-
-
1下载：
旅行商（TSP）问题用自适应记忆遗传算法(Adaptive Memory Genetic Algorithm, AMGA)在matlab下的实现-The traveling salesman problem (TSP), Adaptive Memory genetic algorithm (Adaptive Memory Genetic Algorithm, AMGA) in matlab
-
-
1下载：
旅行商(TSP)问题用标准遗传算法（GA）在matlab下实现的。-The traveling salesman problem (TSP) using standard genetic algorithm (GA) under Matlab.
-
-
0下载：
Code in java for the Traveling salesman problem. This code is very simple because has only three pages. It s works same.
-
-
0下载：
This gives source code of traveling salesman problem. The algorithm used is tabu search.
-
-
0下载：
"Evaluating Ant Colony Optimization on Traveling Salesman Problems" a project report in Algorithm design technique graduate course
-
-
0下载：
这个一个经过优化的旅行商问题代码，运行速度很快-The traveling salesman problem an optimized code that runs fast
-
-
0下载：
旅行商问题，即TSP问题（Traveling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此，任何能使该问题的求解得以简化的方法，都将受到高度的评价和关注。
-Traveling salesman problem, the T
-
-
0下载：
antcolony -traveling salesman problem-java
-
-
0下载：
This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for
-
-
0下载：
旅行商问题，算法设计中最基本也是最重要的问题，希望对学习算法的有所帮助-Traveling salesman problem, algorithm design the most fundamental and important question, want to help the learning algorithms
-
-
0下载：
主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the exis
-
-
0下载：
This cpp source solve the problem 116 - Undirectinal TSP in UVa Online Judge using dynamic programming for traveling salesman problem.
-
-
0下载：
本算法主要是解决传统的旅行商问题最小成本下求解最小路径的问题，已经验证可以运行，没有错误，希望对大家有帮助-This algorithm is mainly to solve the traditional traveling salesman problem minimum cost path for solving the minimum problem has been demonstrated to run, no error, we want to help
-
-
0下载：
Traveling salesman problem implementation in c#. Feel free to modify.
-
