In this paper,some characteristics and processing steps about branch-and-bound method(B&B) are analyzed in more details ,and some strategies,used to solving optimal problems by B&B ,are discussed.
较为详细地分析了分枝定界法的算法特征和过程,讨论了以该算法求解具体优化问题时所要采取的算法策略。
参考来源 - 求解组合优化问题的一种方法—分枝定界法·2,447,543篇论文数据，部分数据来源于NoteExpress
运用多目标规划理论与分枝定界法对模型进行求解。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
该文首先给出一个最优解值的下界估计，它可用于分枝定界法求最优解。
We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
应用推荐