The lower bounded and partial upper bounded distribution model

This paper pruvides a smaller equivalelnt bounded variable transportation problem than that in Charnes, Glover, and Klingman [1] for the lower bounded and partial upper bounded distribution model.     

Efficient computational devices for the capacitated transportation problem

This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed.     

Variations on a cutting plane method for solving concave minimization problems with linear constraints

A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates the question of finiteness of Tui's method to the so-called generalized lattice point problem of mathematical programming and gives a sufficient condition for terminating Tui's method. The paper then presents several branch-and-bound algorithms for solving concave minimization problems with linear constraints with the Tui cut as the basis for the algorithm. Finally, some computational experience is reported for the fixed-charge transportation problem.     

A generalized recursive algorithm for a class of non-stationary regeneration (scheduling) problems

Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques.     

On the generation of deep disjunctive cutting planes

In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint.     

(0, 1) hyperbolic programming problems

In the first part of this paper we study the unconstrained {0, 1} hyperbolic programming problem treated in [1]. We describe a new algorithm for this problem which produces an optimal solution by scanning just once the set of fractions to be analysed. This algorithm shows better computing performance than the one described in [1]. In the second part we study the {0, 1} hyperbolic programming problem with constraints given by inequalities on nondeereasing pseudo-boolean functions. We describe a “branch and bound” type algorithm for this problem.     

块Toeplitz矩阵低复杂度求逆的卫星导航空时抗干扰算法

采样协方差矩阵求逆是空时抗干扰算法的基本运算单元,但由于其运算量随时域抽头个数急剧增长,直接限制了空时抗干扰技术在卫星导航接收机中的应用。针对该问题,提出了基于块Toeplitz矩阵快速求逆的空时抗干扰方法。通过采用新的协方差矩阵近似计算方法,使得该矩阵同时为块Toeplitz矩阵与Hermite矩阵,并运用块Toeplitz矩阵的快速求逆算法,将时域抽头个数为K的计算复杂度从O[K3]降至O[K2]。理论分析和仿真结果表明,在阵元数为4、时域抽头为15的典型情况下,相比现有矩阵求逆方法,该算法的抗干扰性能损耗小于1d B,但计算量可降低约2/3。     

Scheduling to minimize the weighted sum of completion times with secondary criteria

A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems.     

弹道数据处理融合算法的并行计算

针对参考文献[1]中提出的融合多信源信息的融合算法,讨论了其中大计算量的测元遴选问题,并给出了它的并行算法。最后详细地分析了此并行算法的高效性和可扩展性,给出了加速比的仿真结果     

Hilbert空间中Lipschitz拟伪压缩映像公共不动点的杂交投影算法

给出了Hilbert空间中Lipschitz拟伪压缩映像族公共不动点的一个投影算法，并利用所给出的算法证明了一个强收敛定理，扩展了参考文献[1]的结果。     

Makespan minimization for m parallel identical processors

We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [11]), MULTIFIT (Coffman, Garey, and Johnson, [6]), and RMG (Lee and Massey, [17]). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable of greatly improving any seed solution. © 1995 John Wiley & Sons, Inc.     

噪声情况下基于δ—K方法的费米体系数值反演

在文献[1][2]结果的基础上,给出了一个费米体系数值反演的超分辨处理方法。这种广义偏离算法是基于Tikhonov正则化技术,能够在算法中附加各种限制和先验信息,抑制噪声干扰,且计算的复杂性较低。     

一种新的运输问题对偶算法

本文给出求解运输问题的一种新的方法——运输问题对偶算法(仍是表上作业法)。最后给出的实例说明本文算法在解决某些问题时比[1]中方法简便。     

联合补充博弈的费用分摊

就一个仓库、多个零售商,对联合订货费用函数的模型进行分析,给出了一个求解最佳订货周期的多项式时间的算法,且算法的时间复杂性为O（nlogn）。利用文献[8]中的技巧,给出了该库存博弈的核。     

Evaluating cost and reliability integrated performance of stochastic logistics systems

The significance of integrating reliability into logistics performance has been established [The Logistics Performance Index and Its Indicators, World Bank International Trade and Transport Departments, (2010)]. Hence, as a response to the work by the World Bank, the present article aims to evaluate the performance index R_b,d of logistics systems as the probability that a specified demand d can be distributed successfully through multistate arc capacities from the source to the destination under the constraint that the total distribution cost should not exceed the cost limitation b. This article provides a pioneering approach for a straightforward computation of the performance index R_b,d. The proposed algorithm is a hybrid between the polynomial time capacity‐scaling algorithm, which was presented by Edmonds and Karp [JACM 19 (1972)], and the decomposition algorithm, which was presented by Jane and Laih [IEEE (2008)]. Currently, the proposed approach is the only algorithm that can directly compute R_b,d. An illustration of the proposed algorithm is presented. The results of the computational experiments indicate that the presented algorithm outperforms existing algorithms. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

平面内一组线段相对于线光源的可见性

给定平面内一组互不相交的线段 ,将实际光源抽象成有限长度线光源 ,讨论其可见性 ,发现线光源的照射效果等价于线光源两端点的照射效果叠加 ,给出了寻找所有可见边的算法 ,推广了文 [1 ]的结论。     

A special case of the 3 × n flow shop problem

Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc.     

Generalized implicit enumeration using bounds on variables for solving linear programs with zero-one variables

In an earlier paper [1] we put forth a framework that helps to tie together a number of approaches for solving integer programming problems. We outlined there how Balas' Additive Algorithm can be explained and generalized in terms of the framework. In the present paper we review Balas' algorithm, and our earlier framework, and present an algorithm generalizing Balas' scheme. In addition, some examples are presented and future research to be done is discussed.     

有源噪声控制的新近进展（Ⅱ）

从一般封闭空间、混响声场的有源控制及控制器结构与算法三个方面对有源噪声控制进行了评述,并对今后的研究趋势提出了展望。     

Bayes adaptive control of two-echelon inventory systems,II: The multistation case

The present paper extends the results of [7] to cases of multistation lower echelon. For this purpose an algorithm for the optimal allocation of the upper echelon stock among the lower echelon stations is developed. The policy of ordering for the upper echelon is an extension of the Bayes prediction policy developed in [7]. Explicit formulae are presented for the execution of this policy. Several simulation runs are presented and analyzed for the purpose of obtaining information on the behavior of the system, under the above control policy, over short and long periods.