On three basic methods for solving bottleneck transportation problems
- 1 September 1982
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 29 (3) , 505-515
- https://doi.org/10.1002/nav.3800290312
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Weakly admissible transformations for solving algebraic assignment and transportation problemsPublished by Springer Nature ,1980
- An augmenting path method for solving Linear Bottleneck Transportation problemsComputing, 1979
- 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
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”Naval Research Logistics Quarterly, 1971
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- Time‐minimizing transportation problemsNaval Research Logistics Quarterly, 1969
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967