搜索资源列表
fenzhi
- 算法设计程序设计中分支界限法的C++实现-Algorithm design process the design limits of the law branch of C++ to achieve
fenzhijiexian
- 算法设计课程设计中的分支界限算法的c++代码实现-Algorithm design course design algorithm in a branch of the limits of c++ code to achieve
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法,动态规划法,蛮力法,分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
fenzhiTravel
- 用C++实现用分支界限法解决旅行商问题,有可视化界面-Using C++ to achieve with a branch to solve traveling salesman problem limits of law, the visualization interface
11
- 算法设计报告,有5种算法,动态规划,贪心法,回溯法,递归,分支界限法
TSP
- 分支界限法解绝旅行商货郎担问题。
download
- 分支界限算法 ,用队列解决最优装载问题,跟背包算法有同样的功能-Branch and bound algorithm, the optimal loading queue to resolve the problem, with the same functionality Knapsack Algorithm
111
- 用分支界限算法解决旅行上问提,大家可以看看,顺便了解一下用分支界限算法和旅行上-ok o k ko ok o k ok o k oko k ok kok ok ok ok ok ok o ko kok ok o ko ko k
2
- 最短哈密尔顿回路,分支界限法,递归调用,深度优先-The shortest Hamilton circuit, branch and bound method, the recursive call, depth-first
bbTSP
- 货郎担问题的分支界限算法,c++实现-Branch and bound algorithm for Traveling Salesman Problem, c++ implementation. . .
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,
bound
- 算法分析与设计 利用分支界限法计算载重问题-Calculate the weight using branch and bound problems
0-1bag
- 解决0-1背包问题的几种方法,有回溯,有优先分支界限,是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
TSP
- 使用C++描述分支界限算法,编码简单可用实现简单。-Described using C++ algorithm branch boundaries,the coding is very simple and good!
buxian
- 算法分析与设计之分支界限法解决电路布线问题-Algorithm analysis and design of the branch circuit wiring method to solve boundary problems
branchknapser
- 本程序实现分支界限算法求解0-1背包问题,c语言-The boundaries of the program to achieve branch 0-1 knapsack problem algorithm, c language
five
- 利用分支限界法求解旅行商问题 用C++实现用分支界限法解决旅行商问题,-http://www.pudn.com/login.asp
text1
- 本程序详细描述了算法的分支界限法的原理,对于初学分支界限算法很好小程序,通俗易懂。-This procedure describes in detail the principle of the algorithm branch and bound method for beginners branch and bound algorithm very good applet, easy to understand.
0-1beibaowenti(fenzhijiexiansuanfa)
- 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现,包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm