A Note on Assignment Problems

DOI10.1093/COMJNL/6.3.241MaRDI QIDQ5736643zbMATH OpenOpenAlexFDO

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)

• Solving linear bottleneck assignment problems via strong spanning trees
• An augmenting path method for solving linear bottleneck assignment problems
• An improved algorithm for two stage time minimization assignment problem
• Selected topics on 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)