借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。
A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
通过分支定界法对小规模算例的验证表明，本遗传算法获得精确解的比例是高的，由此认为所给遗传算法是很有效的。
The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.
通过分支定界法对小规模算例的验证表明，本遗传算法获得精确解的比例是高的，由此认为所给遗传算法是很有效的。
The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.
应用推荐