A Recursive Method for Solving Assignment Problems

DOI10.1016/S0304-0208(08)73474-1MaRDI QIDQ3923933zbMATH OpenFDO

Authors G. L. Thompson

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73474-1

zbMATH Keywords

assignment problemsbest case behaviorcomputational experiencepolynomially bounded nonsimplex methodrecursive algorithmworst case behavior

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(2)

• An efficient labeling technique for solving sparse assignment problems
• A genuinely polynomial primal simplex algorithm for the assignment problem

This page was built for publication: A Recursive Method for Solving Assignment Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923933)