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

Refael Hassin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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.

Original languageEnglish
Pages (from-to)227-233
Number of pages7
JournalOperations Research Letters
Volume12
Issue number4
DOIs
StatePublished - Oct 1992

Fingerprint

Dive into the research topics of 'Algorithms for the minimum cost circulation problem based on maximizing the mean improvement'. Together they form a unique fingerprint.

Cite this