A description of a new computing procedure for the Hitchcock-Koopmans transportation problem and 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.
This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.