A shortest augmenting path algorithm for dense and sparse linear assignment problems
- 1 December 1987
- journal article
- Published by Springer Nature in Computing
- Vol. 38 (4), 325-340
- https://doi.org/10.1007/bf02278710
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An efficient labeling technique for solving sparse assignment problemsComputing, 1986
- An efficient algorithm for the bipartite matching problemEuropean Journal of Operational Research, 1986
- Signature Methods for the Assignment ProblemOperations Research, 1985
- Algorithm for the solution of the assignment problem for sparse matricesComputing, 1983
- A new algorithm for the assignment problemMathematical Programming, 1981
- Algorithm 548: Solution of the Assignment Problem [H]ACM Transactions on Mathematical Software, 1980
- The Linear Sum Assignment ProblemPublished by Springer Nature ,1980
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959