A Recursive Method for Solving Assignment Problems

From MaRDI portal

Publication:3923933

Jump to:navigation, search

DOI10.1016/S0304-0208(08)73474-1zbMath0469.90051MaRDI QIDQ3923933

Gerald L. Thompson

Publication date: 1981

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

zbMATH Keywords

assignment problems computational experience recursive algorithm worst case behavior best case behavior polynomially bounded nonsimplex method

Mathematics Subject Classification ID

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

Related Items

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3923933&oldid=17597509"