排序方式： 共有31条查询结果，搜索用时 0 毫秒
1.
测定了溶胀的PPU/PSAB 交联聚合物中链段和侧基的13CT1和NOE ,用VJGM模型和三等价位跃迁内旋转、扩散内旋转以及等价、不等价两位置跃迁内旋转模型分析了其中的主链链段运动和侧基内旋转运动 ,求出了主链和侧基的运动相关时间、扩散系数和活化能等参数 .结果表明PS含量对PPU运动的影响极小 ,PS主链运动活化能与PPU含量存在线性关系 .丙烯酸与苯乙烯共聚对PPU的运动几乎无影响 相似文献
2.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
3.
4.
5.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
6.
Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances. 相似文献
7.
突破传统全球导航卫星系统(Global Navigation Satellite System, GNSS)层析反演研究忽略地球磁场对电离层变化活动的影响,同时顾及不同电离层高度电子密度变化较大的影响,提出在地磁坐标系下建立电离层高度方向上不等像素间距的GNSS层析反演方法。在此基础上,通过建立新的电离层层析迭代松弛因子,提高GNSS电离层电子密度层析反演结果精度。利用IRI—2007电离层模型、GNSS实测数据与电离层测高仪数据,从模拟验证和实测数据对比两方面,反演统计了不同层析算法估算的峰值电离层电子密度误差、电子密度剖面结果平均绝对百分比误差及均方根误差,验证了顾及地磁影响的GNSS电离层层析不等像素间距算法的有效性。 相似文献
8.
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
9.
将多目标跟踪中的数据关联问题提成为一个离散最优化问题 ,并采用 L agrangian松驰算法来克服该问题面临的计算困难 ,这是目前多祯多目标测量数据关联研究发展的重要方向。首先将多祯多目标数据关联问题建立为一个带约束的多维分配问题 ;并在维数大于 2时 ,采用 L agrangian松驰算法来松驰约束条件 ,使问题降维为计算上可接受的二维分配问题。 相似文献
10.
根据模型推导了主链运动忽略不计时的侧基多重内旋转运动的相关函数和谱密度函数 ,并用 NMR研究了离聚体乳胶 IPN( Io-LIPN)中 Pn BA侧基的 13C自旋 -晶格弛豫时间 T1.对测得的 T1进行了拟合 .结果表明离主链越远 ,Io-LIPN中聚丙烯酸丁酯的侧基基团内旋转运动速度越快 相似文献