A network isolation algorithm

A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound.     

Stochastic duels with nonrepairable weapons

This paper examines the effect of limitation, regarding weapons that are likely to fail during the period of deployment, on the final outcome in a stochastic duel model. Inter-firing times as well as inter-failure times have been assumed to be exponentially distributed.     

Optimal multicommodity network flows with resource allocation

The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed.     

On constraint qualifications in nonlinear programming

In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above.     

l壳层状态的QSL分类与耦合波函数的计算

本文从准旋、自旋、轨道角动量算符的二次量子化形式出发,讨论了l壳层状态的QSL分类,推导了QSL分类的递推公式并给出了p,d,f壳层的分类结果。应用计算单体、二体算符矩阵元的Slater-Condon规则和解线代数本征值问题子程序,编制了计算l壳层QSL耦合波函数的计算程序,在VAX-11/730机上,对p-壳层和d-壳层共约需半分钟,对f-壳层约需24分钟。