Algorithms for the minimax transportation problem
- 1 November 1986
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 33 (4) , 725-739
- https://doi.org/10.1002/nav.3800330415
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An efficient primal approach to bottleneck transportation problemsNaval Research Logistics Quarterly, 1983
- Efficiency and time-cost-tradeoffs in transportation problemsOR Spectrum, 1982
- An algorithm for solving linearly constrained minimax problemsEuropean Journal of Operational Research, 1982
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problemsNaval Research Logistics Quarterly, 1976
- Parametric analysis of linear programs with upper bounded variablesNaval Research Logistics Quarterly, 1973
- An operator theory of parametric programming for the transportation problem‐INaval 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
- The dual simplex algorithm for bounded variablesNaval Research Logistics Quarterly, 1958