Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

日-地(月)系拉格朗日L1点及晕(Halo)轨道应用

日-地(月)系统拉格朗日L1点及L1点附近的晕(Halo)轨道在"夸父"工程中有重要的应用价值,可用于对太阳实施持续观测.利用数值分析方法,找到了日-地(月)-探测器三者构成的圆限制性三体问题中L1点附近的周期晕(Halo)轨道,分析了轨道的特性.研究结果对"夸父"工程中的目标轨道设计有一定的参考价值.     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

联合作战目标协同模型构建与求解方法?

在对联合作战目标协同研究内容分析的基础上,提出了多任务部队与多作战目标的协同目标分配模型,其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解,验证了分析方法的可行性。     

分布式麦克风阵列的声源定位

声定位探测技术的无源被动特性,使其在定位技术研究领域内独树一帜,时延估计和定位算法是支持这一技术的核心。DUET时延估计算法简单,通过对接收到的信息分段帧移加窗处理,能够有效识别有用语音信息,时延估计精度较高,在高噪声的环境中非常适用;球面定位算法是基于时延估计提出的,对麦克风的排列形式不固定,适用于任意排布的麦克风阵列,并且在时延估计精度较高的情况下,能够很准确地对声源目标进行定位。     

Clifford分析中K超正则函数的Riemann边值问题

Clifford分析中的函数理论被广泛研究,得到的许多结果推广了经典复分析中解析函数的理论。文中研究了Clifford分析中K超正则函数的Riemann边值问题,得到它的一种表示式和Cauchy积分公式等一些性质,利用转化法和积分方程及不动点原理证明了它的一类Riemann边值问题O解的存在唯一性。     

二次型极小化问题的迭代算法

在新的控制条件下,证明了二次型极小化问题的迭代算法的有效性,所得结果改进了徐洪坤关于二次型优化的最新结果。     

钢结构防火材料应用问题及对策探讨

介绍了钢结构防火涂料的分类及特性,分析了钢结构建筑在火灾中的特点,探讨了钢结构防火涂料在技术和应用方面存在的问题,提出了钢结构建筑防火涂料施工时应注意的事项等对策。     

关于地球坐标系中机械能守恒问题

在只考虑地球自转时,地球坐标系中质点和质点组的机械能守恒定律依然成立。     

分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。