A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

Abstract

A simple procedure is given for solving minimal cost flow problems in which feasible flows are maintained throughout. It specializes to give primal algorithms for the assignment and transportation problems. Convex cost problems can also be handled.