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

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.

MoreLess

Year of publication:	1967
Authors:	Klein, Morton
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 14.1967, 3, p. 205-220
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.14.3.205 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009196574