A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。
This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
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.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
The basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.
其综合了分枝定界法与割平面法，减少了分枝次数，简化了割平面的技巧。
The basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.
其综合了分枝定界法与割平面法，减少了分枝次数，简化了割平面的技巧。
应用推荐