branch and bound strategy

基本解釋

Branch and bound strategy is used to optimize the local problem.
該算法應(yīng)用分枝定界法實(shí)現(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.
因此，我們?yōu)槠湓O(shè)計(jì)了一個(gè)多項(xiàng)式時(shí)間的貪心算法以及一個(gè)將貪心策略和分支限界策略集合在統(tǒng)一框架下的復(fù)合算法。
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?
提出了一種增強(qiáng)預(yù)測(cè)范圍聚集查詢EPRA算法，采用更精確的剪枝搜索準(zhǔn)則，減少了查詢所需要訪問的節(jié)點(diǎn)代價(jià)。