借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。

Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.

youdao

理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。

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.

youdao

传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。

Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.

youdao