Hung, Ming S.; Rom, Walter O. Solving the assignment problem by relaxation. (English) Zbl 0441.90062 Oper. Res. 28, 969-982 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 25 Documents MSC: 90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods 90B10 Deterministic network models in operations research Keywords:relaxation; assignment problem; network flow problems; average computation time; worst case behavior PDF BibTeX XML Cite \textit{M. S. Hung} and \textit{W. O. Rom}, Oper. Res. 28, 969--982 (1980; Zbl 0441.90062) Full Text: DOI OpenURL