... branch and bound method || 分支定界法 branch bound method || 分支估界法，分支限界法 branch bound technique || 分支估界技术 ...
基于4个网页-相关网页
branch-bound method 分支界限法 ; 分支定界法 ; 分支界线法
branch and bound method 分支限界法 ; 分枝定界法 ; 分支定界法 ; 分支定界搜索法
branch-bound method a 分枝限界法
simplified branch bound method 简化分枝定界法
Branch and Bound Point Method 分支界限法
branch-and-bound method 分枝限界法
branch-bound methodbranch-bounding method 分枝限界法
Improved Branch and Bound Method 改进的分枝定界法
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
应用推荐