A Combinatorial Algorithm

DOI10.1112/JLMS/S1-21.3.219zbMath0060.02602OpenAlexW1980675521MaRDI QIDQ5834360

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

Related Items (10)

Linear-Time Approximation for Maximum Weight Matching ⋮ Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication ⋮ Optimal assignment of resources to strengthen the weakest link in an uncertain environment ⋮ Critical objective function values in linear sum assignment problems ⋮ The groups of order 128 ⋮ A priority based assignment problem ⋮ Uncertain random assignment problem ⋮ Constructive bounds and exact expectations for the random assignment problem ⋮ Proof Pearl: The Marriage Theorem ⋮ An alternate approach to solve two-level priority based assignment problem

This page was built for publication: A Combinatorial Algorithm