A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and boundtechnique, the computation procedure is greatly reduced.
同时,在计算过程中应用分枝限界方法,可使其计算工作量大大减小。
2
This paper discusses the problem and presents a branch and boundtechnique to find alternate optimal solutions for assignment problem.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
3
A general subset selection method, the branch and boundtechnique, is applied to a control structure selection problem.