Efficient dual simplex algorithms for the assignment problem
Author:
- 1 November 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 33 (2) , 187-203
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Technical Note—A Polynomial Simplex Method for the Assignment ProblemOperations Research, 1983
- Storing a sparse table with O(1) worst case access time1982
- A new algorithm for the assignment problemMathematical Programming, 1981
- Solving the Assignment Problem by RelaxationOperations Research, 1980
- A primal algorithm for optimum matching1978
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- A network simplex methodMathematical Programming, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A Primal Method for the Assignment and Transportation ProblemsManagement Science, 1964