搜索资源列表
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
thedesignofalogrithm
- 该资料介绍了8中算法用于解决一些TSP，背包问题，有分治法，回溯法，等-This document describes the algorithm used to solve some 8 TSP, knapsack problem, partakers treatment method, backtracking, etc.
TSP
- 回溯算法，很好的算法，欢迎下载!性能优越，代码漂亮！-Backtracking algorithm, a good algorithm, welcome to download! Superior performance, code beautiful!
TSPandBAGproblem
- 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is
algorithmTSP
- 基于回溯法的TSP问题解决方案，附有TSP问题相关的c++和matlab解法资料，及工程文件（西电02105143）-Solution of TSP problem based on the backtracking with TSP problem related to c++ and matlab solution data and project files (Western Electric 02105143)
The-TSP-problem
- The TSP problem - 旅行商问题，回溯，分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
TSP
- 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, r