A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree andbranchandboundtechnique, the computation procedure is greatly reduced.
同时,在计算过程中应用分枝限界方法,可使其计算工作量大大减小。
2
The basic ideas of the algorithm is due to concentrating of the brance-boundand the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.
其综合了分枝定界法与割平面法,减少了分枝次数,简化了割平面的技巧。
3
A general subset selection method, the branchandboundtechnique, is applied to a control structure selection problem.