分支定界 meaning in Chinese
branch-and-bound
Examples
- Ga - sa based mixed - model u - shaped assembly line balancing
基于分支定界方法的双边装配线平衡 - Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解优化问题的重要方法。 - 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
计算表明,在保证求得最优解的前提下,该平台能很好地提高分支定界算法的效率。 - This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分两部分，第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。 - The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。