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

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

youdao

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

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

youdao

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

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

youdao