A Code for the Transportation Problem of Linear Programming

Authors:
Britton Harris
Affiliations:
Graduate School of Fine Arts, Department of City and Regional Planning, University of Pennsylvania, Philadelphia, PA
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 2
Cited 2

Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

Journal of the ACM (JACM)
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

Journal of the ACM (JACM)

Pivot Strategies for Primal-Simplex Network Codes

Journal of the ACM (JACM)
Basis properties and algorithmic specializations for gub transformed networks

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.