A Code for the Transportation Problem of Linear Programming
- 1 January 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (1), 155-157
- https://doi.org/10.1145/321921.321937
Abstract
Methods are described and results presented for greatly reducing the computation time for long narrow problems of the transportation problem of linear programming. The code builds on known methods with two principal innovations: a substantial reduction in the size of the tree representation of shipments, and a set of methods for calculating improved starting solutions.Keywords
This publication has 3 references indexed in Scilit:
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- 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