Critical objective function values in linear sum assignment problems
- 16 December 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 842-852
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Data-intensive applications, challenges, techniques and technologies: A survey on Big DataInformation Sciences, 2014
- Assignment Problems2009
- A genuinely polynomial primal simplex algorithm for the assignment problemDiscrete Applied Mathematics, 1993
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- Signature Methods for the Assignment ProblemOperations Research, 1985
- A network simplex methodMathematical Programming, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A Primal Method for the Assignment and Transportation ProblemsManagement Science, 1964
- A Combinatorial AlgorithmJournal of the London Mathematical Society, 1946