1) difference-bounded
差分界定
2) 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.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
3) branch-and-bound
分枝定界
1.
In order to solve this model, a revised branch-and-bound algorithm is designed and illustrated by a numerical example.
通过对模型特征分析,提出了一种分枝定界算法,实例应用及算法复杂性分析证明了该算法的有效性。
2.
Finally, a branch-and-bound algorithm is presented.
本文根据运输问题中一类常见的情况建立了在并容量网络中求最大并流的网络模型，证明了最大并流问题的NP完全性，并给出了求解该问题的一种分枝定界算法。
3.
It is easily shown that this problem is NP-hard,and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
文中简单说明此问题为NP-难问题,并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
4) branch and bound
分枝定界
1.
A reduced branch and bound approach for solving quadratic programming problem with quadratic constraints;
带有二次约束的二次规划问题的一个收缩分枝定界算法
2.
This model is a mixed integerlinear program (MILP), and is solved with a branch and bound (B&B) algorithm.
针对废弃物品的收集、预处理和再制造问题,建立了回收物流设施选址混合整数规划(MILP)模型,用分枝定界法求解。
3.
This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
本文讨论了该问题 ,并提出一种求指派问题多重最优解的分枝定界
5) 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.
以在ｎ台机器上串行加工ｍ个工件为例，讨论调度问题的最优求解方法，在分支定界算法中利用串行加工原理选取下界函数，在得到一个可能解后，通过回潮来取得最优解，从而揭示分枝定界算法在调度问题上的应用。
6) branch and bound algorithm
分枝定界
1.
A genetic branch and bound algorithm is proposed to solve the 3 machine flow-shop permutation problem,which is similar to the often used genetic local algorithm and the genetic dynamic programming algorithm.
提出一种遗传分枝定界算法求解 3机Flow -shop调度问题 。
2.
A genetic branch and bound algorithm is proposed to solve the 3 mach ines Flow-shop permutation problem, which is similar to often used the genetic local algorithm and the genetic dynamic programming algorithm.
Flow shop调度问题属于NP难题,传统的方法很难求出精确最优解,提出了一种遗传分枝定界算法,即在遗传算法中引入分枝定界算法保持对优化解有贡献的工件部分顺序,求解3机Flow shop调度问题,该算法与常用的遗传局部算法和遗传动态规划算法类似,用随机方法测试例子,与目前著名的Taillard的禁忌搜索算法和Reeves的遗传算法两种改进算法进行比较,大量的数据实验证实了遗传分枝定界算法的有效性。
3.
A genetic branch and bound algorithm is proposed to solve the 3 machine flow-shop permutation problem, which is similar to often used the genetic local algorithm and the genetic dynamic programming algorithm.
提出了一种遗传分枝定界算法求解 3机 Flow- shop调度问题 ,该算法类似于常用的遗传局部算法和遗传动态规划算法 。
补充资料：产权界定
产权界定——
产权界定是指国家依法划分财产所有权和经营权等产权归属，明确各类产权形式权利的财产范围和管理权限的一种法律行为。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条