搜索资源列表
Branch and Bound
- Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
LCbb_TSP
- LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman - code
分支界限
- 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
intprog
- 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightl
filldisk-1.01.tar
- filldisk is an utility to optimize filling a media (cd/dvd/others with big files while wasting the minimum amount of space on it. It is an integer binary programming application using a customized branch and bound algorithm which focuses on yes/no
C
- 利用分支限界算法求解最优装载，实现了最优装载问题的求解-The use of branch and bound algorithm to solve the optimal load to achieve the optimal load for solving the problem
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
TSP
- TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.
MaxClique
- 分支界限法解决最大团问题，编译通过，代码正确-Branch and bound method to solve the maximum clique problem, compiled through the correct code
zhengshuguihua
- 整数规划：用割平面法求解整数规划 用分支定界法求解整数规划 用枚举法（包括穷举法和隐枚举法）求解0－1规划 -Integer programming: cutting plane method for solving integer programming with branch and bound method for solving integer programming Solving 0-1 planning enumeration method (exhaustive me
xxx
- MATLAB分支定界法的实现，附带代码和例题-MATLAB implementation of branch and bound method, with code and examples
999
- It s branch and bound method on Delphi.
IntProgFZ
- 分支定界法，不断将可行域分割成小的集合，再找出最优解-Branch and bound method, the feasible region divided into a collection of small, then find out the optimal solution