branch and bound strategy

基本解释

Branch and bound strategy is used to optimize the local problem.
该算法应用分枝定界法实现局部问题的优化。
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.
因此，我们为其设计了一个多项式时间的贪心算法以及一个将贪心策略和分支限界策略集合在统一框架下的复合算法。
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?
提出了一种增强预测范围聚集查询EPRA算法，采用更精确的剪枝搜索准则，减少了查询所需要访问的节点代价。