Open AccessA Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
Author(s) -
Morton Klein
Publication year - 1967
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.14.3.205
Subject(s) - mathematical optimization , simple (philosophy) , computer science , regular polygon , transportation theory , minimum cost flow problem , flow (mathematics) , assignment problem , flow network , mathematics , philosophy , geometry , epistemology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom