Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- 1 December 1976
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 23 (4), 567-595
- https://doi.org/10.1002/nav.3800230402
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Alternate Formulations for Static Multi-Attribute Assignment ModelsManagement Science, 1973
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- An operator theory of parametric programming for the transportation problem‐INaval Research Logistics Quarterly, 1972
- An operator theory of parametric programming for the transportation problem‐IINaval Research Logistics Quarterly, 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
- Some remarks on the time transportation problemNaval Research Logistics Quarterly, 1971
- Time‐minimizing transportation problemsNaval Research Logistics Quarterly, 1969
- Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization DesignManagement Science, 1969
- Solving Bicriterion Mathematical ProgramsOperations Research, 1967