A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

确定线性偏微分方程组可积系统的对合特征集方法

基于Ritt-Wu特征集方法和Riquier-Janet理论,给出一种将线性微分方程组化成简单标准形式的有效算法．该算法通过消去冗余和添加可积条件获得线性微分方程组的完全可积系统(有形式幂级数解)或不相容判定．该算法不仅适用于常系数的线性偏微分方程组,而且对于变系数(以函数为系数)仍然有效．作者还给出了完全可积系统判定定理及其严格证明．     

Quadratic distances for capacity and bi-capacity approximation and identification

The application of multi-attribute utility theory based on the Choquet integral requires the prior identification of a capacity if the utility scale is unipolar, or of a bi-capacity if the utility scale is bipolar. In order to implement a minimum distance principle for capacity or bi-capacity approximation or identification, quadratic distances between capacities and bi-capacities are studied. The proposed approach, consisting in solving a strictly convex quadratic program, has been implemented within the GNU R kappalab package for capacity and nonadditive integral manipulation. Its application is illustrated on two examples.      

Algorithmic and explicit determination of the Lovász number for certain circulant graphs

We consider the problem of computing the Lovász theta function for circulant graphs C_n,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Iterative variable aggregation and disaggregation in IP: An application

This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions.     

基于移动Agent技术的医学图像检索方法

针对现有医学图像检索方法中，检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题，设计并实现了一种基于移动Agent技术的医学图像检索方法，重点讨论了该方法实现的关键技术，包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法．模拟实验结果表明，该方法实时性较强，占用网络带宽较少，采用的算法运算速度提高近10倍、运算复杂度降低约50％，提取的纹理特征能充分表达图像内容，较好地满足了医学图像的检索要求，实现了对医学图像库快速较准确的检索．     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

Inner bounds for the spectrum of quasinormal operators

A linear operator in a separable Hilbert space is called a quasinormal one if it is a sum of a normal operator and a compact one. In the paper, bounds for the spectrum of quasinormal operators are established. In addition, the lower estimate for the spectral radius is derived. Under some restrictions, that estimate improves the well-known results. Applications to integral operators and matrices are discussed. Our results are new even in the finite-dimensional case.