Algorithms and codes for the assignment problem
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 13 (1) , 191-223
- https://doi.org/10.1007/bf02288323
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An efficient algorithm for the bipartite matching problemEuropean Journal of Operational Research, 1986
- Efficient dual simplex algorithms for the assignment problemMathematical Programming, 1985
- A new algorithm for the assignment problemMathematical Programming, 1981
- Algorithm 548: Solution of the Assignment Problem [H]ACM Transactions on Mathematical Software, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithm 415: Algorithm for the assignment problem (rectangular matrices)Communications of the ACM, 1971
- On some techniques useful for solution of transportation network problemsNetworks, 1971
- An algorithm for the assignment problemCommunications of the ACM, 1960
- Variants of the hungarian method for assignment problemsNaval Research Logistics Quarterly, 1956
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955