论文信息 - A Successive Shortest Path Algorithm for The Assignment Problem

A Successive Shortest Path Algorithm for The Assignment Problem

Abstract : In this paper a new successive shortest path (SSP) algorithm for solving the assignment problem is introduced. A computer implementation of this algorithm has been developed and a discussion of the details of this implementation is provided. Computational results are presented which show this implementation of SSP to be substantially more efficient than several recently developed codes including the best primal simplex code. Also, some new theoretical results are presented which are useful in the implementation of SSP, and it is shown that the algorithm has a computational bound of O(n3), where n is the number of origins. (Author)

M. Engquist

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[4] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[5] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[6] Fred W. Glover,et al. Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[7] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[8] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..

[9] Fred Glover,et al. Improved Computer-Based Planning Techniques, Part 1 , 1978 .

[10] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[11] Ming S. Hung,et al. Solving the Assignment Problem by Relaxation , 1980, Oper. Res..