Competitive facility location and design problem

We develop a spatial interaction model that seeks to simultaneously optimize location and design decisions for a set of new facilities. The facilities compete for customer demand with pre-existing competitive facilities and with each other. The customer demand is assumed to be elastic, expanding as the utility of the service offered by the facilities increases. Increases in the utility can be achieved by increasing the number of facilities, design improvements, or locating facilities closer to the customer.     

砂土扰动效应的细观探讨

从细观尺度上分析了砂土类介质两种典型理想单元体内部结构变化对其力学响应的影响；结果表明即使颗粒性质相同，其结构形式（packing)不同亦有不同的力学响应。这为砂土扰动效应提供了一种以定量分析为基础的新解释。     

Polynomials with high multiplicity at unity and Tarry’s problem

The existence of a polynomial with integer coefficients of relatively small length and sufficiently large multiplicity at unity is established. The proof of the corresponding statement is based on an estimate of the number of solutions of Tarry’s system. Translated fromMatematicheskie Zametki, Vol. 65, No. 6, pp. 810–815, June, 1999.     

Stability of quantization dimension and quantization for homogeneous Cantor measures

We effect a stabilization formalism for dimensions of measures and discuss the stability of upper and lower quantization dimension. For instance, we show for a Borel probability measure with compact support that its stabilized upper quantization dimension coincides with its packing dimension and that the upper quantization dimension is finitely stable but not countably stable. Also, under suitable conditions explicit dimension formulae for the quantization dimension of homogeneous Cantor measures are provided. This allows us to construct examples showing that the lower quantization dimension is not even finitely stable. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Integrated Shipment Dispatching and Packing Problems: a Case Study

In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.      

TiO2和SiO2薄膜应力的产生机理及实验探索

对最常用的TiO₂和SiO₂薄膜应力, 包括应力模型、应力测试方法和不同实验条件下的应力测试结果作了研究.基于曲率法模型，对TiO₂和SiO₂单层膜和多层膜进行了实验测试，得到了一些有价值的结果，特别是离子辅助淀积和基板温度等工艺参数对薄膜应力的影响.提出了薄膜聚集密度是应力的重要因素，低聚集密度产生张应力，而高聚集密度产生压应力.在多层膜中通过调节工艺参数，适当地控制张应力或压应力，可使累积应力趋向于零. 关键词： 薄膜应力 离子辅助淀积 聚集密度     

企业家人力资源培训问题的整数规划模型

本文强调了企业家人力资源在企业核心能力和可持续成长能力生成中的重要作用和地位。基于时间和费用指标,研究了企业家人力资源培训问题,利用0-1线性整数规划建立了一个带有培训时间约束的最小培训费用模型,给出了求解模型的基于Lagrange松弛的分解算法,计算实例表明给出的算法是有效的。     

关于F.Smarandache的一个问题

F.Smarandache教授曾提出求最大的正整数r,将集合{1 ,2 ,…,r}分为n类,使得在每一类中方程xy =z(x >1 ,y >1 )无解.确立并证明了r的下界,即r n9.     

无重叠区的双抓钩周期性排序问题的求解

在当今的自动化制造系统中，计算机控制的抓钩的排序直接影响系统的生产率。本文研究了产品在系统的一边装载、而在另一边卸载的电镀线周期性排序问题。工件在每个工作站的处理时间在给定时间范围内，工作站之间没有缓冲槽，相同轨道上的两个抓钩用于工作站之间工件的运送，目标是对运送进行排序以极小化生产周期。为了求解这个问题，本文提出一个求解方法，所提出的方法首先将生产线分为两个无重叠的区域，并且为每个区域分配一个抓钩，然后，提出了一个给定抓钩分配下的混合整数线性规划模型。通过求解不同抓钩分配下模型的最优解，并且选择这些解中最好的一个，以便得到最优解，一个标杆示例被运行，以表明该方法的应用。另外，给出有多重处理槽工序问题的模型和求解方法。     

Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs

Typical implementations of branch-and-bound for integer linear programs choose to branch on single variables. In this paper we explore the use of general disjunctions for branching when solving linear programs with general-integer variables. We give computational results that show that the size of the enumeration tree can be greatly reduced by branching on such disjunctions rather than on single variables.