An optimal algorithm for 2 × n bottleneck transportation problems
- 31 December 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (9) , 525-529
- https://doi.org/10.1016/0167-6377(91)90072-w
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An augmenting path method for solving Linear Bottleneck Transportation problemsComputing, 1979
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problemsNaval Research Logistics Quarterly, 1976
- Finding the medianJournal of Computer and System Sciences, 1976
- The bottleneck transportation problemNaval Research Logistics Quarterly, 1971
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”Naval Research Logistics Quarterly, 1971
- Some remarks on the time transportation problemNaval Research Logistics Quarterly, 1971
- Time‐minimizing transportation problemsNaval Research Logistics Quarterly, 1969