Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Morton Klein (1967) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: