A Note on Assignment Problems

DOI10.1093/COMJNL/6.3.241zbMATH Open0123.37202OpenAlexW2316240524MaRDI QIDQ5736643FDOQ5736643

Authors: E. S. Page 

Publication date: 1963

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/6.3.241

zbMATH Keywords

operations research

Cited In (4)

• Selected topics on assignment problems
• Solving linear bottleneck assignment problems via strong spanning trees
• An improved algorithm for two stage time minimization assignment problem
• An augmenting path method for solving linear bottleneck assignment problems

This page was built for publication: A Note on Assignment Problems

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