论文信息 - Signature Methods for the Assignment Problem

Signature Methods for the Assignment Problem

The "signature" of a dual feasible basis of the assignment problem is an n-vector whose ith component is the number of nonbasic activities of type i, j. This paper uses signatures to describe a method for finding optimal assignments that terminates in at most n-1n-2/2 pivot steps and takes at most On3 work.

Michel Balinski | M. Balinski

[1] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[2] R. Gomory,et al. A Primal Method for the Assignment and Transportation Problems , 1964 .

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

[4] William H. Cunningham,et al. A network simplex method , 1976, Math. Program..

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

[6] W. H. Cunningham,et al. Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[7] E. Roohy-Laleh. Improvements in the Theoretical Efficiency of the Network Simplex Method , 1980 .

[8] Ming S. Hung,et al. Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[9] M. L. Balinski,et al. The Hirsch Conjecture for Dual Transportation Polyhedra , 1984, Math. Oper. Res..

[10] M. Balinski,et al. Faces of dual transportation polyhedra , 1984 .

[11] Donald Goldfarb,et al. Efficient dual simplex algorithms for the assignment problem , 1986, Math. Program..