Efficient dual simplex algorithms for the assignment problem

This publication has 14 references indexed in Scilit:

• Technical Note—A Polynomial Simplex Method for the Assignment Problem
  Operations Research, 1983
• Storing a sparse table with O(1) worst case access time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• A new algorithm for the assignment problem
  Mathematical Programming, 1981
• Solving the Assignment Problem by Relaxation
  Operations Research, 1980
• A primal algorithm for optimum matching
  Published by Springer Nature ,1978
• The alternating basis algorithm for assignment problems
  Mathematical Programming, 1977
• A network simplex method
  Mathematical Programming, 1976
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  Journal of the ACM, 1972
• A Primal Method for the Assignment and Transportation Problems
  Management Science, 1964