搜索资源列表
fzjx
- 货郎担问题的分支限界算法,速度很快,并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35
01bag
- 用蛮力法,回溯法,分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
tsp
- tsp问题高效代码,程序为c语言编写,算法为分支限界。-tsp issue of efficient code, the program for the c language
ctest
- 推箱子状态空间搜索,慢慢研究吧。分支限界法,采用优先队列实现-tuixiangzi
0-1bag
- 实现0—1背包问题的分支限界搜索,为控制台应用程序,编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
limit
- 用C实现了分支限界算法,读者可以运行该程序理解分支限界算法-Achieved with the C branch and bound algorithm, readers can run the program understand the branch and bound algorithm for
NGProblem
- 有关图的NP问题代码 包括贪心算法求解 分支限界法 优化的分支限界法-NP problems solutions.
AlgorithmCode
- C++版本的各类算法源代码,包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorit
TSP
- 这是用Delphi编写的程序,目的是用TSP(分支限界法)实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem
traveller
- 本程序是算法设计的经典问题,采用分支限界发解决旅行商问题-This program is a classic algorithm design problem, using branch and bound fat Traveling Salesman Problem
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
0-1knapsackBranchBound
- 0-1 背包 分支限界法(0-1knapsackBranch&Bound) vc-0-1knapsackBranch&Bound
BBShortest
- 用分支限界法实现单源最短路径 用分支限界法的思想-Branch and bound method with single-source shortest path with the idea of branch and bound
lvxingshouhuoyuan
- 旅行售货员问题的java版本,采用分支限界法。有详细解释-Traveling salesman problem is the java version, using branch and bound. Explained in detail
push
- 算法推箱子问题,对于给定的仓库布局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置, 设计一个解推箱子问题的分支限界法, 计算出仓库管理员将箱子从开始位置推到目标位置所 需的最少推动次数。-push problem
LCKNAP
- 背包问题的LC分支-限界算法 计算机算法设计背包问题求解-LC branch knapsack problem- a computer algorithm and bound algorithm for solving knapsack problem
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 prog
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
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