本文研究了资源有限—工期最短的优化问题,提出了相应的分枝定界算法。
In this pater, the problem of limited resources and shortest time limit for a project is studied and an algorithm of branch and bound method for this problem is proposed.
该文首先给出了求在线性约束下极小化有限个阶梯函数和的一种分枝定界算法。
This paper first presents a branch-and-bound algorithm to minimize a finite sum of stair-case functions under linear constraints.
应用推荐