... 分枝定界法 branch and bound 分枝限界法 branch-and-bound method 分支定界法 branch and bound algorithm ...
基于2个网页-相关网页
branch and bound method 分支限界法 ; 分枝定界法 ; 分支定界法 ; 分支定界搜索法
Improved Branch and Bound Method 改进的分枝定界法
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.
较为详细地分析了分枝定界法的算法特征和过程,讨论了以该算法求解具体优化问题时所要采取的算法策略。
参考来源 - 求解组合优化问题的一种方法—分枝定界法By converting discrete variables into continuous variables, applying the primal-dual interior method to global optimization and the branch-and-bound method based on BFS (breadth-first-search) to deal with the discrete variables, the exact solution obtained is more reasonable than the conventional result.
通过把离散变量连续化，采用原始对偶内点法在可行域内进行全局寻优，并结合基于广度优先遍历的分支定界法对离散变量进行归整处理，从而找到比传统无功优化更加合理的全局最优解。
参考来源 - 基于分布式计算环境的电力系统无功优化研究·2,447,543篇论文数据，部分数据来源于NoteExpress
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
With the aim at deriving optimal solutions, branch-and-bound method is one of the most well adopted implicit enumerative approaches.
为达成获得最佳解的目标，分支界定法是最常采用的列举法之一。
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.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。
应用推荐