In addition, the branch-bound method is used in iterative process, these making it possible to reduce the search time in many situations.

此外在迭代过程中使用了分枝界限法，通常可显著减少迭代时间。

youdao

Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.

分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。

youdao

Numerical experiments showed that the branch and bound method with these techniques was effective.

实验表明，基于这些结果所构造的分支定界算法是有效的。

youdao