The shortest augmenting path method for solving assignment problems — Motivation and computational experience
- 1 December 1985
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 4 (1) , 57-102
- https://doi.org/10.1007/bf02022037
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Signature Methods for the Assignment ProblemOperations Research, 1985
- A new algorithm for the assignment problemMathematical Programming, 1981
- Algorithm 548: Solution of the Assignment Problem [H]ACM Transactions on Mathematical Software, 1980
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- A network simplex methodMathematical Programming, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- A Primal Method for the Assignment and Transportation ProblemsManagement Science, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959