A Combinatorial Algorithm

DOI10.1112/JLMS/S1-21.3.219zbMATH Open0060.02602OpenAlexW1980675521MaRDI QIDQ5834360FDOQ5834360

Authors: T. E. Easterfield 

Publication date: 1946

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-21.3.219

zbMATH Keywords

combinatorics

Cited In (10)

• A priority based assignment problem
• The groups of order 128
• An alternate approach to solve two-level priority based assignment problem
• Critical objective function values in linear sum assignment problems
• Constructive bounds and exact expectations for the random assignment problem
• Linear-time approximation for maximum weight matching
• Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
• Uncertain random assignment problem
• Optimal assignment of resources to strengthen the weakest link in an uncertain environment
• Proof pearl: the marriage theorem

This page was built for publication: A Combinatorial Algorithm

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