An algorithm for the assignment problem
From MaRDI portal
Publication:3276894
DOI10.1145/367436.367476zbMath0097.32501MaRDI QIDQ3276894
Publication date: 1960
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/367436.367476
Related Items
An analysis of the stable marriage assignment algorithm, Improving the Hungarian assignment algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Measures of invariance and comparability in factor analysis for fixed variables, A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm, Transportation problems which can be solved by the use of hirsch-paths for the dual problems