This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ford et al. (1956) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: