branch and bound strategy

基本解釋

Branch and bound strategy is used to optimize the local problem.
該算法應(yīng)用分枝定界法實現(xiàn)侷部問題的優(yōu)化。
This paper presents a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
因此，我們爲其設(shè)計了一個多項式時間的貪心算法以及一個將貪心策略和分支限界策略集郃在統(tǒng)一框架下的複郃算法。
Also developed for the PRA tree is an enhanced predictive range aggregate (EPRA) query algorithm which uses a more precise branch and bound searching strategy, reducing the disk I?
提出了一種增強預(yù)測範圍聚集查詢EPRA算法，採用更精確的剪枝搜索準則，減少了查詢所需要訪問的節(jié)點代價。