搜索资源列表
BBShortest
- 用分支限界法实现单源最短路径 用分支限界法的思想-Branch and bound method with single-source shortest path with the idea of branch and bound
fenzhijiexian
- 1.分支界限算法背包问题 2.算法之分支限界法的旅行售货员问题-1. Branch and bound algorithm for knapsack problem 2. Branch and bound algorithm for the traveling salesman problem
lvxingshouhuoyuan
- 旅行售货员问题的java版本，采用分支限界法。有详细解释-Traveling salesman problem is the java version, using branch and bound. Explained in detail
arrange_of_circle
- 用分支限界法和回溯法进行圆排列，是算法中的经典问题，两个程序都能进行文件的读取和写入，是非常好用的程序。-Using branch and bound and backtracking method round arrangement, is a classic problem algorithm, the two programs can read and write to files is very easy to use program.
chenlieguan
- 世界名画陈列馆由nm × 个排列成矩形阵列的陈列室组成。为了防止名画被盗， 需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4 个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最少。 算法设计： 设计一个优先队列式分支限界法，计算警卫机器人的最佳哨位安排，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最
knight
- 在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。这样的跳马步骤称为1 个成功的骑士征途。例如，当n=5 时的1 个成功的骑士征途如下图所示。 1 2 3 4 5 1 25 14 1 8 19 2 4 9 18 13 2 3 15 24 3 20 7 4 10 5 22 17 12 5 23 16 11 6 21 算法设计： 对于给定的n和n*n方格的起始位
Algorithm_analysis_and_design_of_branch_and_bound.
- 算法分析设计之分支限界法Algorithm analysis and design of branch and bound-Algorithm analysis and design of branch and bound Algorithm analysis and design of branch and bound
1(2)
- 分支限界法之布线问题 一、要求： 1、输入电路板区域n*m以及布线的起始位置和结束位置； 2、输出布线方案； 3、可以使用c或者vc实现 二、问题分析及实验原理： 在n*m的方格阵列中存在封锁区域（布线时必须绕开的区域），找到起始位置到目标位置的最短路径。从目标位置开始向起始位置回溯，逐步构造最优解。每次向标记距离比当前方格标记距离少1的相邻方格移动，直到到达起始方格为止。-Branch and bound method of a wiring
Sudoku
- branch and bound, solve sudoku
TravelingSalesmanProblem
- 解决旅行售货员问题的优先队列式分支限界法-Solve the traveling salesman problem of the priority queue-type branch and bound
Branch_Bound_code
- branch and bound algorith used in solving the travelling salesman problem
7
- 分支界限法的课件，很详细，很强大，很好的学习资料，献给大家了！-Branch and bound courseware, very detailed, very powerful, very good learning materials, dedicated to all of you!
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. . .
somealgorithm
- 描述了分支定界算法，贪婪算法，动态规划算法，分而治之算法，回溯算法，理论性很强-Describe the branch and bound algorithm, greedy algorithms, dynamic programming algorithm, divide and conquer algorithms, backtracking algorithms, highly theoretical
theshortestpath
- 用分支限界搜索法求解单源最短路径问题的算法-Branch and bound search method with a single-source shortest path algorithm
greatgroup
- 最大团的分支限界法编程，棋盘覆盖问题c++编程-The largest group of branch and bound program, the board cover problem c++ programming
bnb
- 利用matlab编写的求解优化问题的分支定界算法，程序为函数形式可直接调用-Using matlab to solve optimization problems written in branch and bound algorithm, the program can be called directly as a function of the form
LuxingShouhuoyuan
- 履行售货员问题的分支限界解法，实现最短路径的搜索-Perform branch and bound method salesman problem
komiv_3
- traveling salesman problem c + + branch and bound method