搜索资源列表
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。 ,Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is
0-1bag
- 解决0-1背包问题的几种方法,有回溯,有优先分支界限,是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report