A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
应用推荐