1) branch and bound strategy
分支定界策略
1.
Through analyzing similarities and differences between the RLP and the RCPSP,we develop a branch and bound strategy based approximate algorithm for solving the RLP based on a GAs for solving the RCPSP.
针对 RL P与 RCPSP的相似之处和自身特点 ,以求解 RCPSP的遗传算法为基础 ,设计了一种求解 RL P的基于分支定界策略的近似算法 。
2) branch bound strategy
分枝定界策略
1.
By means of calculating network flows with branch bound strategy and the minimum weighted number of late jobs with ready time, the problem of the late and the stoppage in departure because of lacking of the car flows are solved.
以压缩车辆在编组站停留时间为目标，建立阶段计划车流推算模型，考虑列车解体顺序与列车出发计划的综合协调问题，并通过求解带分枝定界策略的网络流及有准备时间的带权最小误工工件数问题，解决了编组站因车流不足需停运出发列车运行线的问
3) branch and bound
分支定界
1.
An efficient branch and bound algorithm for CMST problem;
CMST问题的高效分支定界算法研究
2.
Aimed at the lack of research on two-sided assembly line balancing problem status in quo,the characteristics of two-sided assembly line were analyzed and the special requirements of balancing were studied,the mathematical model was built,then a balancing algorithm which was based on branch and bound was developed.
针对目前研究较少的双边装配线平衡问题,分析、研究了双边装配线的特点及其对平衡的特殊要求,建立双边装配线平衡问题的数学模型,并提出一种分支定界算法来最优化装配线的平衡。
3.
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
4) branch and bound algorithm
分支定界
1.
The paper takes the branch and bound algorithm for example and introduces the design philosophy and practical steps of the process.
以分支定界法为例,介绍了其设计思想和实践步骤,并对算法的时间复杂度进行了分析。
2.
The application of branch and bound algorithm on dispatching problem is discussedby the example of m workpieces being processed on n machines serially.
以在ｎ台机器上串行加工ｍ个工件为例，讨论调度问题的最优求解方法，在分支定界算法中利用串行加工原理选取下界函数，在得到一个可能解后，通过回潮来取得最优解，从而揭示分枝定界算法在调度问题上的应用。
5) branch-and-bound
分支定界
1.
New branch-and-bound algorithm for indefinite quadratic programming problems
求不定二次规划问题全局解的新的分支定界算法
2.
By means of the concept of level-by-level which has been in the theory of strategy, we put forward a branch-and-bound algorithm from a completely new perspective.
本文针对一个尚未解决的问题Pm|intree;pj=1;rj|Cmax进行了研究,借助于决策论中的递阶层次结构的概念提出一个全新的分支定界算法,并用这一算法得到了问题Pm|intree;pj=1;rj|Cmax的最优排序。
3.
According to specific structure of the model,this paper proposed the appropriate column generation algorithm combined with the traditional simplex algorithm,Dantzig-Wolfe decomposition and branch-and-bound strategy.
根据模型的特点,本文结合了传统单纯形法、D-W分解技术、分支定界技术提出了针对该模型的列生成算法,并用MATLAB程序实现了此算法(见附录)。
6) branch-and-bound method
分支定界法
1.
Interior point method and branch-and-bound method for unit commitment;
内点-分支定界法在最优机组投入中的应用
2.
Study on optimal power flow based on primal-dual interior point algorithm under perturbed KKT conditions and branch-and-bound method;
基于扰动KKT条件的原始-对偶内点法和分支定界法的最优潮流研究
3.
By converting discrete variables into continuous variables,applying the primal-dual interior method to global optimization within the feasible domain and integrating with the branch-and-bound method based on BFS(Breadth-First-Search) for the discret.
针对实际电力系统的数学模型包含离散变量和连续变量的特点,提出了一种精确求解电力系统无功优化的方法——内点分支定界法。
补充资料：分支定界法
分子式：
CAS号：
性质：又称分支定界搜索法。过程系统综合的一类方法。该法是将原始问题分解，产生一组子问题。分支是将一组解分为几组子解，定界是建立这些子组解的目标函数的边界。如果某一子组的解在这些边界之外，就将这一子组舍弃。分支定界法原为运筹学中求解整数规划(或混合整数规划)问题的一种方法。用该法寻求整数最优解的效率很高。将该法原理用于过程系统综合可大大减少需要计算的方案数日。
CAS号：
性质：又称分支定界搜索法。过程系统综合的一类方法。该法是将原始问题分解，产生一组子问题。分支是将一组解分为几组子解，定界是建立这些子组解的目标函数的边界。如果某一子组的解在这些边界之外，就将这一子组舍弃。分支定界法原为运筹学中求解整数规划(或混合整数规划)问题的一种方法。用该法寻求整数最优解的效率很高。将该法原理用于过程系统综合可大大减少需要计算的方案数日。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条