1) Lagrangean relaxation algorithm
拉格朗日松驰算法
1.
Lagrangean relaxation algorithm for disjoint QoS routing;
可分离QoS路由的拉格朗日松驰算法
2) Lagrangian relaxation technique
拉格朗日松驰解法
1.
Based on the analysis of practical situations and lot transfer between stages,an integer programming mode is proposed,The solution is obtained by the application of Lagrangian relaxation technique.
将一般作业车间中零件的批量平行顺序移动制造方式同提前/拖期问题相结合,并针对问题的物理模式提出相应的整数规划模型,给出了问题的拉格朗日松驰解法。
3) Lagrangean relaxation
拉格朗日松驰
1.
A model of multi-collection-site and multi-product for this problem was constructed and a heuristic algorithm based on Lagrangean relaxation was proposed.
构建了多回收源点、多企业参与回收多种回收物品,且每一回收物品处理站对每种回收物品有最大处理容量约束的网络优化模型,提出了基于拉格朗日松驰的启发式算法,并通过一组算例验证了算法的适用性和有效性。
4) Lagrangian relaxation
拉格朗日松驰
1.
Lagrangian relaxation has recently emerged as an important technique for solving complex scheduling problems.
拉格朗日松驰法为求解复杂调度问题次最优解的一种重要方法,陆宝森等人把这种方法推广到JobShop调度问题,但他们的方法存在解振荡问题。
2.
Lagrangian relaxation and projection subgradientmethod is made use of, and disjoint bilinear programming problems to be producedare regarded as subproble.
在这个算法里应用了分枝定界方法,用两个空间的单纯形二剖分得到对可行域的剖分,用拉格朗日松驰定界技术以及投影次梯度方法,通过解一系列不连接双线性规划问题,确定目标函数在每个剖分集上的下界。
5) Lagrangian relaxation algorithm
拉格朗日松弛算法
1.
Lagrangian relaxation algorithm of S-D assignment problem is studied in this paper.
拉格朗日松弛算法在现代优化启发式算法中占有重要地位,本文对多维分配问题的拉格朗日松弛算法进行研究,重点研究松弛次序对数据互联结果的影响。
2.
The complexity of Lagrangian relaxation algorithm and optimal algorithm are compared,and the Lagrangian relaxation algorithm is applied to 3-D assignment problem.
将拉格朗日松弛算法与最优求解算法的复杂性进行了分析比较,并将该算法应用于求解3-D分配问题,分析与算例结果表明,该算法可大幅度降低3-D分配问题的求解计算量,是求解3-D分配问题的一种有效算法。
3.
In this paper a Mixed Integer Programming(MIP) model is proposed and the improved Lagrangian relaxation algorithm is employed to solve the model.
研究了多星多观测任务调度这一NP完全问题,建立了多星任务规划调度的混合整数规划模型,并对模型的求解进行了研究,提出运用改进的拉格朗日松弛算法来求解。
6) Lagrangean relaxation algorithm
拉格朗日松弛算法
1.
Based on the network model adapt to Qos routing mechanism in,a new mathematics programming model to solve QoS routing is established and a modified Lagrangean relaxation algorithm is presented.
在文献犤9犦提出的适应QoS路由机制的网络模型基础上,利用数学规划,提出了一种QoS路由算法的新的数学模型,并采用改进的拉格朗日松弛算法求解模型。
补充资料:风入松 湖上九日
【诗文】:
哀筝一抹十三弦。飞雁隔秋烟。携壶莫道登临晚,双双燕、为我留连。仙客玲珑玉树,佳人窄索金莲。琅琅新雨洗湖天。小景六桥边。西风泼眼山如画,有黄花、休恨无钱。细看茱萸一笑,诗翁健似当年。
【注释】:
【出处】:
哀筝一抹十三弦。飞雁隔秋烟。携壶莫道登临晚,双双燕、为我留连。仙客玲珑玉树,佳人窄索金莲。琅琅新雨洗湖天。小景六桥边。西风泼眼山如画,有黄花、休恨无钱。细看茱萸一笑,诗翁健似当年。
【注释】:
【出处】:
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条