branch-bound algorithm [数] [计] 分支定界算法
branch & bound algorithm 分枝定界求解算法
branch and bound algorithm 分支定界算法 ; 分枝界定法 ; 分枝定界算法
multi-branch-and-bound algorithm 分枝
global branch-and-bound algorithm 全局分枝一约界算法
layered branch and bound algorithm 分层分枝定界算法
advanced branch-and-bound algorithm 改进的分枝限界法
improved branch and bound algorithm 改进的分支定界法
parallel branch and bound algorithm 并行分枝限界算法
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
应用推荐