搜索资源列表
fenzhixianjie
- 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
buxianwenti
- 实验要求：请在下图所给出电路板中，按布线要求，利用队列式或优先队列分支限界法实现从a到b的布线工作 -Experimental requirements: On the graph below given circuit board, wiring requirements, queue or priority queue branch and bound method to achieve the wiring from a to
Eight-puzzle
- 八数码难题-两种不同的分支限界法解决 input.txt中为起始的状态，output.txt\output2.txt为两种不同解法的输出-Eight digital problem- two different branch and bound method for solving input.txt initial state, output.txt \ output2.txt solution for the two diffe
Branch-threshold-method
- 运用分支限界法解布线问题。Branch threshold method wiring-Branch threshold method wiring
6d2
- 王晓东《算法设计与分析》第六章第二节分支限界法求单源最短路劲问题源代码-Xiaodong " algorithm design and analysis" section 6.2 branch and bound method for single-source shortest path problem Energizer source code
6d3-1
- 王晓东《算法设计与分析》第六章第三节装载问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter III loading problems queue-style branch and bound method to solve
6d3-2
- 王晓东《算法设计与分析》第三节装载问题优先队列式分支限界法求解-Xiaodong " algorithm design and analysis" problem loading priority queue type III branch and bound method to solve
6d4
- 王晓东《算法设计与分析》第六章第四节布线问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter IV wiring problems queue-style branch and bound method to solve
6d5
- 王晓东《算法设计与分析》第六章第五节0-1背包问题分支限界法求解-Xiaodong " algorithm design and analysis," Chapter V 0-1 knapsack problem branch and bound method to solve
fzxj
- 分支限界法是一种优化方法，背包问题是NP完全问题，本程序通过分支限界实现了一种优化的背包。-Branch and bound method is an optimization method, knapsack problem is NP-complete problems, this program through the branch and bound to achieve an optimized backpack.
nqueen
- 这是一个用c++实现的，关于用分支限界法求解n皇后问题的小程序，希望对所有初学者能够有所帮助-This is a c++ achieve, on the use of branch and bound method to solve n-queens problem of small procedures, we hope to be helpful to all beginners
Wiring
- 利用分支限界法解决布线问题，按照优先队列中规定的优先级选取优先级最高的节点成为当前扩展节点-Wiring problem
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5
zuidatuan-yanjiu
- 最大团问题的 分支限界法与回溯法比较Python写成。-Backtracking branch and bound method and comparison of the maximum clique problem written in Python.
fenzhixianjiefa
- 算法设计与分析题目： 把长度为l1,l2…ln 的n个程序放在磁带T1和T2上，并且希望按照使用最大检索时间取得最小值的方式存储，即如果存放在T1和T2上的程序集合分别为A和B，则希望所选择的A和B使得max{∑li 1,∑li2}(i1属于A，i2属于B)取得最小。 使用分支限界法实现。-Algorithm design and analysis
Line
- 算法分编程布线问题，常用语机器人布线的代码，采用了分支限界法求解。可以作为辅助参考。-Algorithms Programming wiring problem, common language robot wiring code, using the branch and bound method to solve. Can be used as an auxiliary reference.
chapter-6
- 算法设计与分析 第6章 分支限界法（讲解较详细）-Algorithm Design and Analysis Chapter 6 branch and bound method (explained in more detail)
Branch-threshold-method
- 运用分支限界法解布线问题。Branch threshold methodwiring-Branch threshold methodwiring
Work
- 算法-分支限界法-任务分配问题 数组的话可以自己修改-algorithms-branch and bound method- work assignment problem
fenzhixianjie
- 计算机算法分析里面分支限界法中很多算法的源码-Computer algorithm analysis, many of which branch and bound algorithm source code