A New Algorithm for Tree Modification in the Primal Transportation Problem

Britton Harris
Additional contact information
Britton Harris: University of Pennsylvania, Philadelphia

Transportation Science, 1978, vol. 12, issue 4, 271-276

Abstract: Primal methods for the transportation problem of linear programming require substantial bookkeeping to deal with constant updating of a tree describing the shipments in the current feasible solution. This paper suggests a new means of bookkeeping which is useful for long narrow problems. The method builds on previous work by the same author which reduces the number of records to be updated. The new methods reduce the number of items which have to be maintained for a replication of the tree and simplify some steps in updating the remaining items.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.4.271 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:12:y:1978:i:4:p:271-276

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().