搜索资源列表
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
IntProgFZ
- 利用分支定界法求解整数规划问题,结果精确-Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
Unwrap2D
- Goldstein s branch cut phase unwrapping method.
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现,是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
branch_prediction_simulatot
- the five branch prediction simulators,it can simulate by using different trace file, and can be compared with different simulator -five branch prediction simulators of computer archicture
branch
- C/S模式下 listview控件分页功能实现-C/S model listview branch function
submission.tar
- Branch and bound is one of the best complete. algorithms for the tsp decision problem
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic program
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
matlabmiaoshu
- 分支定界法的matlab描述,其中有具体的代码信息 -Branch and bound method described in matlab
metody
- branch and bound tsp
Desktop
- 实验四:分枝限界算法设计 实现课本上旅行售货员问题的分枝限界算法(P225),随机生成两个规模为10和20的TSP实例,比较算法运行时间。 提交源代码以及实验报告。 -Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Boun
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.
BranchBound
- 最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
nqueens
- 分支限界法解决皇后问题,在nxn棋盘上放n个棋子,要求两个棋子不能放在同一列上-Queens branch and bound method to solve the problem, put the board in the nxn n-piece, two pieces can not be requested on the same column
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
5f
- cutting algorith for branch and cut
bnb20
- 在实际应用着经常需要求解非线性整数规划或混合规划问题,该领域中的一种常用的算法是分支定界(branch and bound)算法,但是matlab工具箱中没有相关的函数。荷兰Groningen大学的Koert Kuipers编写的的BNB20工具箱可以用来求解一般非线性整数规划问题-In practice, frequent need to solve nonlinear integer programming or mixed pro
PhaseUnwrapping2D
- 2D PHASE UNWRAPPING ALGORITHMS Run QualityGuidedUnwrap2D for the phase quality guided phase unwrapping method. Run GoldsteinUnwrap2D for Goldstein s branch cut phase unwrapping method. (3D implementation o