搜索资源列表
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.
TravelingSalesmanProblem
- This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function D
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
bnb20
- 在实际应用着经常需要求解非线性整数规划或混合规划问题，该领域中的一种常用的算法是分支定界(branch and bound)算法，但是matlab工具箱中没有相关的函数。荷兰Groningen大学的Koert Kuipers编写的的BNB20工具箱可以用来求解一般非线性整数规划问题-In practice, frequent need to solve nonlinear integer programming or mixed pro
TSP
- 本程序通过使用分支限界法实现旅行商问题，成功解决了旅行商问题-This procedure achieved by using the branch and bound traveling salesman problem, successfully solved the traveling salesman problem
main
- 分支限界法实现旅行售货员问题，使用时间挺短的，代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code
wrewwererw
- 分支限界法解决——TSP问题的讲述，及其算法（是PPT）-Branch and bound method to solve- TSP problem about its algorithm (which is PPT)
p2_branch
- branch and bound algorithm for solving a scheduling problem
A-branch-and-bound-algorithm-for-asymmetric-TSP.r
- A branch-and-bound algorithm for asymmetric TSP
bound
- 算法分析与设计 利用分支界限法计算载重问题-Calculate the weight using branch and bound problems
the-branch-and-bound-algorithm
- 算法：用分支定界求最短路径,北航计算机学院算法课作业-Algorithm: get the shortest path using the branch and bound algorithm
Branch-and-Bound
- 最新国际顶级杂志IJCV2011目标检测论文-Branch and Bound Hough Transform for Object Class Detection,IJCV2011
Bound-file
- 捆绑文件 可以跟正常文件捆绑一起-Files can be bound with normal file bound together
branch-and-bound-algorithm
- 分支界限算法，通过一个小实例简单的介绍了分支界限算法的思想，其中包括源码运行截图和运行的.exe文件-A brief introduction of the branch and bound algorithm
branch-and-bound
- 分支定界法求解TSp问题的分析研究以及matlab实现-Branch and bound method to solve the problem described TSp
branch-and-bound-algorithm
- 利用c++实现城市遍历问题的分枝定界算法。-Use c++ achieve urban traversal problem branch and bound algorithm.
Branch-and-bound-method
- MALAB写的，分支定界法求解纯整数或混合的整数规划问题。-Written MALAB, branch and bound method to solve pure integer or mixed integer programming problem.
2-Cramer-Rao-Lower-Bound
- What is the Cramer-Rao Lower Bound