branch-and-bound

常见例句

Extensive computational experiment shows that the branch-and-bound method is efficient in solving concave integer programming problems.
数值结果表明，用这种分枝定界方法求解凹整数规划是有效的。
In this paper, some characteristics and processing steps about branch-and-bound method(B&B) are analyzed in more details , and some strategies, used to solving optimal problems by B&B , are discussed.
较为详细地分析了分枝定界法的算法特征和过程，讨论了以该算法求解具体优化问题时所要采取的算法策略。
The conventional surrogate constraint method, which can improve the efficiency of branch-and-bound or cutting plane algorithms, can not guarantee to find the optimal solution of the primal problem.
本文介绍了混合整数两层线性规划问题，引入代理约束，构造计算简单的定界函数，提出一个分支定界算法，并给出算例说明算法是有效的。