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

1 November 1967

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 14 (3) , 205-220
https://doi.org/10.1287/mnsc.14.3.205

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.

Keywords

MINIMAL
FLOWS
GIVE
HANDLED
PROCEDURE
SOLVING
CONVEX
SPECIALIZES
PRIMAL METHOD

This publication has 0 references indexed in Scilit: