搜索资源列表
-
0下载：
YALMIP，用于求解整数规划，主要思想为分支界定，效率和功能都比较好-YALMIP, for solving integer programming, the main idea of the branch and bound, efficiency and function are better
-
-
0下载：
分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。(Branch and bound (branch and bound) is one of the most commonly used algorithms for integer programming problems. This method can not only solv
-
-
1下载：
matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)
-
