Thompson, Gerald L. A recursive method for solving assignment problems. (English) Zbl 0469.90051 Ann. Discrete Math. 11, 319-343 (1981). For the entire collection see [Zbl 0465.00007]. Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 2 Documents MSC: 90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) 65K05 Numerical mathematical programming methods Keywords:recursive algorithm; polynomially bounded nonsimplex method; assignment problems; worst case behavior; computational experience; best case behavior PDF BibTeX XML Cite \textit{G. L. Thompson}, Ann. Discrete Math. 11, 319--343 (1981; Zbl 0469.90051) Full Text: DOI OpenURL