该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
为了提高求解一般整数线性规划问题的效率，提出了一种基于目标函数超平面移动的分支算法。
In order to improve the computational efficiency, a branch algorithm for general integer linear programming problems on the objective function hyperplane shifts was presented.
该模型基于混合整数线性规划模型，以供应网络内总生产成本和物流成本最小化作为目标函数，并应用标准优化软件求解。
Minimizing total production and logistic costs within the supply network was considered as the objective function. This modified model can be solved using standard optimization software.
应用推荐