Solving the Transportation Problem

L. R. Ford, Jr. and D. R. Fulkerson
Additional contact information
L. R. Ford, Jr.: The RAND Corporation
D. R. Fulkerson: The RAND Corporation

Management Science, 1956, vol. 3, issue 1, 24-32

Abstract: A simplified description of a new computing procedure for the Hitchcock-Koopmans transportation problem is given, together with a step by step solution of an illustrative example. The procedure is based on Kuhn's combinatorial algorithm for the assignment problem and a simple "labeling process" for solving maximal flow problems in networks. The proposed computation appears to be considerably more efficient than the specialized form of the simplex method which is in common use.

Date: 1956
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.3.1.24 (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:ormnsc:v:3:y:1956:i:1:p:24-32

Access Statistics for this article

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