Furthermore, a branchandbound algorithm based on face search which comes from optimization over efficient set is described.
借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
2
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics andBranch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
3
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree andbranch and bound technique, the computation procedure is greatly reduced.