branch and bound search 分支界限搜索
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
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.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
应用推荐