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

Authors:
Refael Hassin
Affiliations:
School of Mathematical Sciences, Department of Statistics, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Operations Research Letters
Year:
1992

Citing 4
Cited 0

Note on Weintraub's minimum-cost circulation algorithm

SIAM Journal on Computing
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Minimizing capacity violations in a transshipment network

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A dual algorithm for submodular flow problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.