Key points are not available for this paper at this time.
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.
Morton Klein (Wed,) studied this question.