An augmenting path method for solving Linear Bottleneck Assignment problems
- 1 December 1978
- journal article
- Published by Springer Nature in Computing
- Vol. 19 (4), 285-295
- https://doi.org/10.1007/bf02252026
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An algebraic approach to assignment problemsMathematical Programming, 1977
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problemsNaval Research Logistics Quarterly, 1976
- Technical Note—An Improved Algorithm for the Bottleneck Assignment ProblemOperations Research, 1971
- Some remarks on the time transportation problemNaval Research Logistics Quarterly, 1971
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- Time‐minimizing transportation problemsNaval Research Logistics Quarterly, 1969
- A Note on Assignment ProblemsThe Computer Journal, 1963
- QuicksortThe Computer Journal, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955