1) 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.
以压缩车辆在编组站停留时间为目标，建立阶段计划车流推算模型，考虑列车解体顺序与列车出发计划的综合协调问题，并通过求解带分枝定界策略的网络流及有准备时间的带权最小误工工件数问题，解决了编组站因车流不足需停运出发列车运行线的问
2) 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的基于分支定界策略的近似算法 。
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.
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调度问题 ,该算法类似于常用的遗传局部算法和遗传动态规划算法 。
6) branch and bound algorithm
分枝定界法
1.
Moreover, a branch and bound algorithm is given.
接着又给出了求解该问题的一个分枝定界法。
2.
At the same time,its algorithm is also obtained which is a branch and bound algorithm.
这类数学模型尽管可以转化为0-1规划模型,但它相对于转化后的0-1规划模型:①决策意义明确,表达形式相对简单;②不需要引入参数M并在求解前确定其上界;③相对于求解转化后的0-1规划模型的分枝定界法,新分枝定界算法在最好情形下计算量最多为原算法的八分之一。
补充资料：皮米诺定 ,去痛定,匹米诺定
药物名称：匹米诺定
英文名：Piminodine
别名： 皮米诺定 ,去痛定,匹米诺定
外文名：Piminodine
适应症： 为强效麻醉性镇痛药，镇痛作用较呱替啶强。用于胆囊炎合并胆结石、胰腺炎、癌症等引起的剧痛。
用量用法： 1.皮下注射或肌注：１次１０～２０ｍｇ，必要时每４小时１次。 2.口服：１次２５～５０ｍｇ。
注意事项： 有成瘾性。
规格： 1.片剂：２５ｍｇ。 2.注射液：１０ｍｇ。
类别：镇痛药\阿片受体激动药
英文名：Piminodine
别名： 皮米诺定 ,去痛定,匹米诺定
外文名：Piminodine
适应症： 为强效麻醉性镇痛药，镇痛作用较呱替啶强。用于胆囊炎合并胆结石、胰腺炎、癌症等引起的剧痛。
用量用法： 1.皮下注射或肌注：１次１０～２０ｍｇ，必要时每４小时１次。 2.口服：１次２５～５０ｍｇ。
注意事项： 有成瘾性。
规格： 1.片剂：２５ｍｇ。 2.注射液：１０ｍｇ。
类别：镇痛药\阿片受体激动药
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条