Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
Based on the general principle of the branch-and-bound method, the branching rule and the bounding calculating method to solve this problem are proposed.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
应用推荐