TY - JOUR

T1 - Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

AU - Hassin, Refael

PY - 1992/10

Y1 - 1992/10

N2 - Several recent polynomial algorithms for the minimum cost circulation problem have the following in common: The solution, primal or dual, is changed in a way that the mean improvement of the objective function with respect to some measure is maximized. This note contains some new insight on such algorithms. In addition, it is shown that a dual algorithm which selects node-wise maximum mean cuts, is not polynomially bounded.

AB - Several recent polynomial algorithms for the minimum cost circulation problem have the following in common: The solution, primal or dual, is changed in a way that the mean improvement of the objective function with respect to some measure is maximized. This note contains some new insight on such algorithms. In addition, it is shown that a dual algorithm which selects node-wise maximum mean cuts, is not polynomially bounded.

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

U2 - 10.1016/0167-6377(92)90048-8

DO - 10.1016/0167-6377(92)90048-8

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

AN - SCOPUS:0039095126

SN - 0167-6377

VL - 12

SP - 227

EP - 233

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -