Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - tsp branch and bound algorithm

Search list

[Other] tsp.c

Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
Platform: | Size: 3463 | Author: 郎风华 | Hits:

[Other resource] mazh

Description: 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category.
Platform: | Size: 2187 | Author: 赵刚 | Hits:

[Data structs] mazh

Description: 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category.
Platform: | Size: 2048 | Author: 赵刚 | Hits:

[File Operate] BNB20

Description: 利用matlab进行分支定界的算法-using Matlab for branch-and-bound algorithm
Platform: | Size: 4096 | Author: 潘峰 | Hits:

[Other] tsp.c

Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
Platform: | Size: 3072 | Author: 郎风华 | Hits:

[Data structs] huishufa

Description: 用分支限界法求界旅行商问题，用Ｃ＋＋语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
Platform: | Size: 185344 | Author: yangyang | Hits:

[AI-NN-PR] 750

Description: A branch-and-bound algorithm for asymmetric TSP
Platform: | Size: 14336 | Author: foxman | Hits:

[Data structs] d_function

Description: 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.
Platform: | Size: 886784 | Author: 吴男 | Hits:

[AI-NN-PR] TSP_BranchAndBound

Description: Solving the TSP problem using the Branch and Bound Algorithm
Platform: | Size: 30720 | Author: nabilnapel | Hits:

[Mathimatics-Numerical algorithms] wtsf.tgz

Description: 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 computing network longest shortest route. C Traveling Salesman Bound algorithm. C Knight Dijkstra shortest path algorithm for traversing the network. C
Platform: | Size: 20480 | Author: swikon | Hits:

[Data structs] Desktop

Description: 实验四：分枝限界算法设计 实现课本上旅行售货员问题的分枝限界算法(P225)，随机生成两个规模为10和20的TSP实例，比较算法运行时间。 提交源代码以及实验报告。 -Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Bound algorithm (P225), randomly generated two size 10 and 20 of the TSP instance, comparison algorithm running time. Report submitted to the source code and experimental.
Platform: | Size: 14336 | Author: pactric | Hits:

[AI-NN-PR] wrewwererw

Description: 分支限界法解决——TSP问题的讲述，及其算法（是PPT）-Branch and bound method to solve- TSP problem about its algorithm (which is PPT)
Platform: | Size: 128000 | Author: 王郑东 | Hits:

[Algorithm] A-branch-and-bound-algorithm-for-asymmetric-TSP.r

Description: A branch-and-bound algorithm for asymmetric TSP
Platform: | Size: 15360 | Author: Tom | Hits:

[Other] ChTSP

Description: 分支限界算法求解TSP问题，还不错，可以下载-Branch-and-bound algorithm for TSP, well, you can download to see
Platform: | Size: 23552 | Author: kkk | Hits:

[Algorithm] Branch_and_bound_for_TSP_tutorial

Description: 该程序是用分支定界算法解决旅行商问题，所用语言为Matlab-The program is branch and bound algorithm for TSP problem
Platform: | Size: 16384 | Author: 熊福力 | Hits:

[Other] How-to-Solve-It-Modern-Heuristics

Description: 全书包括两部分共15章。第1章指出问题求解困难的原因；第2章简要介绍几本概念；第3-5章分别综述穷举搜索法、局部搜索法、贪婪法、分而治之法、动态规划法、分支定界法、模拟退火法和禁忌搜索法；第6-7章介绍一般演化算法的细节问题；第8-10章介绍如何采用演化方法求解TSP问题、处理约束条件以及算法调整；第11章讨论了环境和噪声问题；第12-13分别提供神经网络和模糊系统相关内容；第14章对混合系统和扩展演化算法做简短讨论；第15章介绍演化算法在实际问题中的应用，并给出有价值的提示。-The book includes two parts with 15 chapters. The first chapter points out the reasons for the problem solving difficult the second chapter briefly introduces some of the concepts Chapter 3-5 respectively in exhaustive search, local search, greedy, divide and rule method, dynamic programming, branch and bound method, simulated annealing and tabu search method 6-7 chapter details the general evolution algorithm how to 8-10 chapter introduces evolution method for solving TSP problem, constraint conditions and algorithm the eleventh chapter discusses the environment and the problem of noise the 12-13 respectively with neural network and fuzzy system related content the fourteenth chapter on the mixing system and evolution algorithm is briefly discussed the fifteenth chapter introduces the application of evolutionary algorithm in practical problems, and gives valuable hints.
Platform: | Size: 10104832 | Author: alvin | Hits:

CodeBus www.codebus.net