Solving the Transportation Problem

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.

• 저널Management Science · 3(1) · 24–32
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.3.1.24
• 저자L. R. Ford, D. R. Fulkerson