搜索资源列表
园排列问题
- 分支限界法解圆排列问题，是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs
优先队列式分支限界法园排列问题
- 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
BNB20
- 利用matlab进行分支定界的算法-using Matlab for branch-and-bound algorithm
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
BNB20.rar
- branch-and-bound-tree algotihm for optimization,branch-and-bound-tree algotihm for optimization
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
branchbound
- 算法作业，采用分支定界算法，求解最小路径问题-Algorithm operations, branch and bound algorithm for solving the minimum path problem
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
game1
- 分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
TSP
- this a branch and bound code for TSP-this is a branch and bound code for TSP
metody
- branch and bound tsp
branchandbound_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
branch-and-bound-algorithm
- 分支界限算法，通过一个小实例简单的介绍了分支界限算法的思想，其中包括源码运行截图和运行的.exe文件-A brief introduction of the branch and bound algorithm
branch-and-bound-method
- MALAB写的，分支定界法求解纯整数或混合的整数规划问题。-Written MALAB, branch and bound method to solve pure integer or mixed integer programming problem.
branch-and-bound
- VC6.0中控制台应用程序实现的分支限界的算法。-branch and bound algorithm VC6.0 console application implementation.
branch-and-bound-method
- 利用分支限界法找出最大全1子团和最大全-1子团，内附文档说明-Use branch and bound method to find the maximum full sub-group and the largest full 1 sub-group, enclosing documentation
Traveling-Salesman-Problem-with-branch-and-bound-
- branch and bound for solve travel salse man problem
bxcnch-branch
- branch and bound appearance simulation branch and bound branch and bound, branch and bound can be very good
code_branch_s3vm
- 分支定界的半监督支持向量机，将分支定界与半监督SVM完美的结合(semi-supervised support vector machine based on branch and bound)