An augmenting path method for solving Linear Bottleneck Transportation problems
- 1 March 1979
- journal article
- Published by Springer Nature in Computing
- Vol. 22 (1) , 1-15
- https://doi.org/10.1007/bf02246556
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An augmenting path method for solving Linear Bottleneck Assignment problemsComputing, 1978
- A general Hungarian method for the algebraic transportation problemDiscrete Mathematics, 1978
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problemsNaval Research Logistics Quarterly, 1976
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution ProblemsJournal of the ACM, 1972
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution ProblemsTransportation Science, 1972
- The bottleneck transportation problemNaval Research Logistics Quarterly, 1971
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- Time‐minimizing transportation problemsNaval Research Logistics Quarterly, 1969
- QuicksortThe Computer Journal, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959