利用分支限界算法求解最优装载，实现了最优装载问题的求解-The use of branch and bound algorithm to solve the optimal load to achieve the optimal load for solving the problem

整数规划：用割平面法求解整数规划 用分支定界法求解整数规划 用枚举法（包括穷举法和隐枚举法）求解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

MATLAB分支定界法的实现，附带代码和例题-MATLAB implementation of branch and bound method, with code and examples