Affordable Access

Solving the Transportation Problem

Authors
Disciplines
  • Computer Science
  • Mathematics

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Solving the generalized transportation problem

on Regional Science and Urban Eco... Jan 01, 1981

Move it! Solving patient transportation problems.

on Materials management in health... April 1995

An approach for solving a class of transportation...

on European Journal of Operationa... Jan 01, 1979
More articles like this..