搜索资源列表
tsptsp
- 用C++编写的旅行售货员问题,采用的是回朔算法,对初学算法设计的人很有帮助哦!-prepared by the travel salesman, using the back Schomburg algorithm, algorithm design for beginners who helpful Oh!
traveljinshi
- 旅行售货员问题的近似算法 数据结构 算法 NP完全问题-traveling salesman problem approximation algorithm data structure algorithms NP-complete problem
shouhuoyuan
- 实现简单的旅行售货员问题,就是简单的旅行售货员的vc实现-achieve simple travel salesman problem is simple travel achieving saleswoman's vc
LINGOchengxu
- lingo程序文件，包含旅行售货员问题，二次分配问题等
旅行售货员问题
- 旅行售货员问题的解是一棵排列树．在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop
shouhuoyuan_fenzhixianjiehehuosufa
- 在vc++平台下，用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误，包括运行文档。
解旅行售货员问题的优先队列式分支限界法
- 解决旅行售货员问题的优先队列式分支限界法C++源程序
旅行售货员问题
- 旅行售货员问题的解是一棵排列树．在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop
tsptsp
- 用C++编写的旅行售货员问题,采用的是回朔算法,对初学算法设计的人很有帮助哦!-prepared by the travel salesman, using the back Schomburg algorithm, algorithm design for beginners who helpful Oh!
traveljinshi
- 旅行售货员问题的近似算法 数据结构 算法 NP完全问题-traveling salesman problem approximation algorithm data structure algorithms NP-complete problem
shouhuoyuan
- 实现简单的旅行售货员问题,就是简单的旅行售货员的vc实现-achieve simple travel salesman problem is simple travel achieving saleswoman's vc
LINGOchengxu
- lingo程序文件，包含旅行售货员问题，二次分配问题等-lingo program files, including the travel salesman problem, quadratic assignment problem, etc.
shouhuoyuan_fenzhixianjiehehuosufa
- 在vc++平台下，用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误，包括运行文档。-In vc++ Platform, using branch and bound and backtracking realize the travel salesman problem. After I run the correct tests, including the operation of the document.
TSP
- tsp动态规划解决旅行售货员问题 -tsp dynamic programming to solve the issue of travel salesman
huisu-lvxing
- 旅行售货员问题,采用回溯算法实现,可以运行,带注释-Traveling salesman problem
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).
TSP
- 介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法-Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to
Travelingsalesman
- 旅行售货员问题，实现旅行时不同地点之间的最短距离达到最小耗费-Traveling salesman problem, realization of traveling the shortest distance between different locations to achieve the minimum cost
Desktop
- 实验四：分枝限界算法设计 实现课本上旅行售货员问题的分枝限界算法(P225)，随机生成两个规模为10和20的TSP实例，比较算法运行时间。 提交源代码以及实验报告。 -Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Boun
7旅行售货员
- 上传的这个程序是使用C语言编写的旅行商问题。(Upload this program is written in C language, it is to solve the traveling salesman problem)