一类特殊二次分配问题的线性化求解新方法

许多抽象于实际的二次分配问题，其流矩阵与距离矩阵中有很多零元素，求解该类二次分配问题时，可通过先行利用零元素的信息减小问题规模，缩短计算时间．以二次分配问题的线性化模型为基础，提出了一种求解流矩阵与距离矩阵中同时存在大量零元素的二次分配问题新方法，不仅从理论上证明了方法的可行性，而且从实验的角度说明了该方法比以往方法更加优越．     

关于销售集团投资设置销售分店问题的IP模型

针对一个实际投资实例建立了一个基于 0 -1背包问题的数学模型 ,并利用多个算法加以求解 ,并对结果进行了比较 .该模型具有很高的应用价值和参考价值 .     

运输问题的模糊聚类分析求解

通过对传统模糊聚类经验公式的改进和对最后两类排序的确定,提出了一种基 于模糊聚类分析的运输问题简单快速的求解方法．编出了通用程序,并给除了实例和计算 结果．该算法既是模糊聚类分析应用的扩展,又是对运筹学知识的补充和完善．     

求解不等式约束优化问题的一个改进算法

本文改进了一个求解不等式约束优化问题的对偶算法，建立了一个相应的算法，进一步证明了该算法的收敛性．最后，给出数值结果以验证该算法的有效性。     

解线性约束优化问题的新锥模型信赖域3法

本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法．论文采用零空间技术消除了新锥模型子问题中的线性等式约束，用折线法求解转换后的子问题，并给出了解线性等式约束优化问题的信赖域方法．论文提出并证明了该方法的全局收敛性，并给出了该方法解线性等式约束优化问题的数值实验．理论和数值实验结果表明新锥模型信赖域方法是有效的，这给出了用新锥模型进一步研究非线性优化的基础．     

最大并流

本文根据运输问题中一类常见的情况建立了在并容量网络中求最大并流的网络模型，证明了最大并流问题的NP完全性，并给出了求解该问题的一种分枝定界算法．     

最大b匹配的花算法

1引言b匹配问题是匹配问题的推广,它在国内研究较少,但在国外已有一定研究．文献[3]给出了b匹配的应用实例,文献[4]～[6]给出了b匹配算法的研究成果,这些算法主要有两类:第一类为通过b匹配问题的线性规划模型求解,第二类为将b匹配问题转化为匹配问题求解．本文首次提出增广迹的概念,证明定理1[M为G的最大b匹配(?)G中不存在M增广迹]的正确性,并仿照最大匹配的花算法设计最大b匹配的花算法,即直接对b匹配问题求解,避免将b匹配问题转化为匹配问题,这样就可以将各顶点b(vi)     

求解一类约束优化问题的Newton分裂算法

本文给出了求解一类约束优化问题的一个Newton分裂算法，并证明了算法的局部平方收敛性，该算法与已有算法相比，具有计算量小的特点，因而特别适合于求解大规模问题，为进一步降低算法的计算复杂性，我们结合Broyden算法，给出了两类Broyden类分裂算法。     

公交车调度问题的数学模型

对2001年全国大学生数学建模竞赛的B题－公交车调度问题进行了分析，建立了调度的目标规划模型及0－1规划模型。在假设各站上、下车人数服从均匀分布的条件下，通过对模型的求解，求出了公交公司的最小运行车辆数52辆，并给出了发车时刻表，其中上行方向运行225班次，下行方向运行220班次，该模型简单，求解容易，能较好地考虑各方利益。     

供给总量限定需求区间约束型运输问题——时限费用优化模型与算法

本文目的是为建立与运输问题有关的决策支持系统提供方便.本文建立了供给总量限定需求区间约束型运输问题的对时限与费用两个目标进行优化的多目标规划模型,给出了求解模型的算法,并举例说明了算法的应用.该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点.数值实验表明该算法有较高的计算效率,可用于求解某些类型的指派问题.     

软件项目支付进度问题研究

软件项目的复杂性和特点使得其支付进度问题较具特殊性。针对软件质量的差异性,对软件项目支付进度问题进行研究。以承包商净现值最大化为优化目标,构建了具有惩罚结构的支付进度优化模型,该模型反映了不同软件质量对承包商收益的影响;针对该问题的特点设计了启发式求解算法;最后通过一个算例对模型进行了验证。可为承包商在签订外包合同及外包实施中的策略提供决策依据。     

Parameterized Scalar Profile Mixing Model for Turbulent Combustion Simulations

The composition fields in turbulent reacting flows are affected by turbulent transport (macromixing), molecular diffusion (micromixing), and chemical reactions. In the joint velocity-composition probability density function transport equation the highly non-linear macromixing and chemical reaction terms appear in closed form. This is a considerable advantage over moment closure methods. Micromixing on the other hand requires modeling and especially for turbulent combustion accurate mixing models are crucial. Our approach to model the mixing of scalars, e.g. species mass fractions or temperature, is based on considering one-dimensional parameterized scalar profiles (PSP). Here, an extension of the PSP mixing model to inhomogeneous flows is presented. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

PSP对癌症病人化/放疗毒性反应的数据统计分析

按WHO抗癌药急性及亚急性毒性分级标准 ,对 650例化、放疗肿瘤患者分别作了治疗前后毒性反应的总分值统计。结果加服PSP组 ( 557例 )的疗后总分值为837,低于疗前的 962 ;而 93例阳性对照组 (加服鲨肝醇 )疗前总分为 157,疗后为 2 4 1,疗后总分高于疗前。用Wilcoxon两样本秩和统计法检验 ,PSP组和对照组间具有极显著差异 ,表明PSP对比、放疗药物引起的毒副反应有明显降低效应。     

A three-phase matheuristic for the Packaging and Shipping Problem

E-commerce has been continuously growing in the last years to a primary retail market. Recently in France, the threshold of 1 billion of online transactions was overcome. Due to a high demand fluctuation of e-commerce, the workforce sizing for the logistic chain is a challenging problem. Companies have to develop good strategies to have a sustainable workforce size while guaranteeing a high-level service.In this paper, we consider the management of the workforce for a warehouse of an e-commerce company. Specifically, we address issues as i) How the workforce at the warehouse can be determined; ii) What is the daily operational production planning; iii) How the demand peaks can be smoothed, and the production maintained ideally constant over the time horizon.To provide answers to these issues, we introduce the Packaging and Shipping Problem (PSP). The PSP looks for a solution approach that jointly determines the workforce over a multi-period horizon and daily operational plans while minimizing the total logistics cost. We consider two strategies that aim to enhance the flexibility of the process and the efficiency of resources use: reassignment and postponement. To tackle the Packaging and Shipping Problem we propose a model, and a three-phase matheuristic. This heuristic is proved to be competitive with respect to the direct solution of the model with a commercial solver on real-life based instances.     

Partitioned state and parameter estimation for real-time flood forecasting

A new algorithm is developed for simultaneous state-parameter estimation in real-time flood-forecasting applications. Dubbed the partitioned state-parameter (PSP) algorithm, is it unusual in the way that the parameter filter is formulated explicitly in terms of the identifiable parameters in the transition and input coefficient matrices. By virtue of its parallel filter structure the algorithm is very fast, yet it has been designed so that essential error interactions between the forecasting and parameter filters are preserved. Furthermore, PSP is structured so that input coefficients are only updated when the corresponding inputs are actually applied. This feature is useful for systems subject to sporadic inputs. The algorithm is tested with real and synthesized daily rainfall-runoff data from the Hillsborough River in Florida. PSP is found to produce good forecasts and parameter estimates and is much faster than the extended Kalman filter.     

A note on the partitioning shortest path algorithm

Recently Glover, Klingman and Phillips proposed the Partitioning Shortest Path (PSP) algorithm. The PSP algorithm includes as variants most of the known algorithms for the shortest path problem. In a subsequent paper, together with Schneider, they proposed several variants of the PSP and conducted computational tests. Three of the variants were the first polynomially bounded shortest path algoriths to maintain sharp labels as defined by Shier and Witzgall. Two of these variants had computational complexity O(|N|²|A|), the other O(|N|³). In this note, we add a new step to the PSP algorithm resulting in new variants also scanning from sharp labels and having computational complexity O(|N|³) for two of them and O(|N|²) for the other. This new step also provides a test for the early detection of negative length cycles.     

Two novel methods for vibration diagnosis to characterize non-linear response

Poincaré maps have been proved to be a valuable tool in the analysis of non-linear dynamical systems, which usually reduce a continuous phase flow into a two-dimensional discrete map. However, they may be inconvenient for reflecting some characteristics of the system response. In this paper, two novel methods, using the period sampling peak-to-peak value (PSP) diagram and the modified Poincaré map, are presented for characterizing different types of non-linear response. These two methods take advantage of some parameters of the response, such as the peak-to-peak value within an exterior excitation period and the mean value of the displacement. In the PSP diagram method, a two-dimensional graph is plotted by taking the peak-to-peak value as ordinate and the sequential periodically sampling number as abscissa. On the other hand, the modified Poincaré map takes the mean value of the velocity within an exterior excitation period as ordinate and the relevant mean value of the displacement as abscissa. The non-linear responses of a Duffing system, a pendulum with circular motion support and an oscillating circuit are studied by these methods. We also studied the intermittent chaos of the Lorenz system by the PSP diagram method. The PSP diagram is a set of mapping points, which form: a straight line for a one-period response; multi-straight lines for a multi-period response; orderly periodic curves for a quasi-period response; long lines interrupted by transitoriness confusion points for intermittent chaos; and totally out-of-order points for chaos. The figures for the modified Poincaré maps for the period, multi-period, quasi-period responses and chaos are almost identical to those for the Poincaré maps, but the modified maps take more sampling points and can reflect the mean values of the responses. Some numerical results are given based on these methods to show their efficiency in distinguishing different non-linear responses.     

Mixing Model Based on Parameterized Scalar Profiles

The composition fields in turbulent reacting flows are affected by turbulent transport (macromixing), molecular diffusion (micromixing), and chemical reactions. In the joint velocity-composition probability density function transport equation the highly nonlinear macromixing and chemical reaction terms appear in closed form. This is a considerable advantage over second moment closure methods. Micromixing on the other hand requires modelling and especially for turbulent combustion accurate mixing models are crucial. In this paper we present an approach to model the mixing of scalars, e.g. species mass fractions or temperature, based on considering one-dimensional parameterized scalar profiles (PSP). (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A mixing model providing statistics of the conditional scalar dissipation rate

Joint composition probability density function (PDF) methods are used for the numerical simulation of turbulent reactive flows. Here, other than in classical Reynolds averaged Navier–Stokes (RANS) or large eddy simulation (LES) approaches, the highly non-linear chemical source term appears in closed form. On the other hand, mixing models are required for the closure of the molecular diffusion term. In the present work, the joint statistics of the scalar and the scalar dissipation rate provided by the parameterized scalar profile (PSP) mixing model are validated. The goal is to combine the PDF method with a flamelet approach, where the scalar dissipation rate plays a crucial role in determining the contribution of the chemical source term. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

HOMOMORPHISMS BETWEEN SYMPLECTIC GROUPS

Let F and F_1 be fields with |F| > 5, and n, n_1 integers satisfying $n\geq n_1$. The present paper determines the forms of homomorphisms from SP_{2n}(F) to SP_{2n}(F_1) and that from PSP_{2n}(F) to PSP{2n}(F_l).