| Article ID: | iaor19931152 |
| Country: | Netherlands |
| Volume: | 12 |
| Issue: | 4 |
| Start Page Number: | 227 |
| End Page Number: | 233 |
| Publication Date: | Oct 1992 |
| Journal: | Operations Research Letters |
| Authors: | Hassin Rafael |
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.