Hung, Ming S. A polynomial simplex method for the assignment problem. (English) Zbl 0519.90056 Oper. Res. 31, 595-600 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 17 Documents MSC: 90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) 68Q25 Analysis of algorithms and problem complexity 90C05 Linear programming 65K05 Numerical mathematical programming methods Keywords:polynomial primal simplex algorithm; assignment problem; integer cost coefficients PDF BibTeX XML Cite \textit{M. S. Hung}, Oper. Res. 31, 595--600 (1983; Zbl 0519.90056) Full Text: DOI OpenURL