Efficient dual simplex algorithms for the assignment problem

Efficient algorithms based upon Balinski's signature method are described for solving then × n assignment problem. These algorithms are special variants of the dual simplex method and are shown to have computational bounds of O(n3). Variants for solving sparse assignment problems withm arcs that require O(m) space and O(mn + n2 logn) time in the worst case are also presented.

[1]  O. H. Brownlee,et al.  ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[2]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

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

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

[5]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

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

[9]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

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

[11]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[12]  Michael L. Fredman.  And e.szemer~di.storing a sparse table with o(1) worst case access time , 1982, FOCS 1982.

[13]  S. Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

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

[15]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[16]  R. Tarjan.  Amortized Computational Complexity , 1985 .

[17]  Robert E. Tarjan,et al.  Self-Adjusting Heaps , 1986, SIAM J. Comput..

[18]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.