TY - JOUR

T1 - The minimum cost flow problem

T2 - A unifying approach to dual algorithms and a new tree-search algorithm

AU - Hassin, Refael

PY - 1983/6

Y1 - 1983/6

N2 - This paper is concerned with the minimum cost flow problem. It is shown that the class of dual algorithms which solve this problem consists of different variants of a common general algorithm. We develop a new variant which is, in fact, a new form of the 'primal-dual algorithm' and which has several interesting properties. It uses, explicitly only dual variables. The slope of the change in the (dual) objective is monotone. The bound on the maximum number of iterations to solve a problem with integral bounds on the flow is better than bounds for other algorithms.

AB - This paper is concerned with the minimum cost flow problem. It is shown that the class of dual algorithms which solve this problem consists of different variants of a common general algorithm. We develop a new variant which is, in fact, a new form of the 'primal-dual algorithm' and which has several interesting properties. It uses, explicitly only dual variables. The slope of the change in the (dual) objective is monotone. The bound on the maximum number of iterations to solve a problem with integral bounds on the flow is better than bounds for other algorithms.

KW - Minimum Cost Network Flow

KW - Primal-Dual Algorithm

KW - Tree-Search Algorith

UR - http://www.scopus.com/inward/record.url?scp=0020708796&partnerID=8YFLogxK

U2 - 10.1007/BF02591772

DO - 10.1007/BF02591772

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0020708796

SN - 0025-5610

VL - 25

SP - 228

EP - 239

JO - Mathematical Programming

JF - Mathematical Programming

IS - 2

ER -