Article PDF
Reference
M.L. Balinski, “Signature methods for the assignment problem“,Operations Research 33 (1985) 527–536.
Rights and permissions
About this article
Cite this article
Goldfarb, D. Efficient dual simplex algorithms for the assignment problem. Mathematical Programming 34, 372 (1986). https://doi.org/10.1007/BF01582238
Issue Date:
DOI: https://doi.org/10.1007/BF01582238