Solving linear bottleneck assignment problems via strong spanning trees
- 30 September 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 12 (3) , 179-180
- https://doi.org/10.1016/0167-6377(92)90103-a
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Maximum matchings in bipartite graphs via strong spanning treesNetworks, 1991
- A competitive (dual) simplex method for the assignment problemMathematical Programming, 1986
- Efficient dual simplex algorithms for the assignment problemMathematical Programming, 1985
- An augmenting path method for solving Linear Bottleneck Assignment problemsComputing, 1978
- Technical Note—An Improved Algorithm for the Bottleneck Assignment ProblemOperations Research, 1971
- A Note on Assignment ProblemsThe Computer Journal, 1963