ACM Home Page
Please provide us with feedback. Feedback
A Code for the Transportation Problem of Linear Programming
Full text PdfPdf (183 KB)
Source Journal of the ACM (JACM) archive
Volume 23 ,  Issue 1  (January 1976) table of contents
Pages: 155 - 157  
Year of Publication: 1976
ISSN:0004-5411
Author
Britton Harris  Graduate School of Fine Arts, Department of City and Regional Planning, University of Pennsylvania, Philadelphia, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 110,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321921.321937
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GLOVER, F., KARNEY, D., AND KLINGMAN, D. The augmented predecessor index method for locating stepping-stone paths and assxgning dual prices in distribution problems Transportation Scz. 6, 2 (1972), 171-179.
2
3



Peer to Peer - Readers of this Article have also read: