Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A Note on Assignment Problems

From MaRDI portal
Publication:5736643
Jump to:navigation, search

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


Authors: E. S. Page Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5736643&oldid=30490636"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 04:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki