| Article ID: | iaor20041159 |
| Country: | United States |
| Volume: | 21 |
| Issue: | 3 |
| Start Page Number: | 529 |
| End Page Number: | 539 |
| Publication Date: | Aug 1996 |
| Journal: | Mathematics of Operations Research |
| Authors: | Goldfarb D., Jin Z.Y. |
This paper presents a modified version of Algorithm MCF proposed by Goldberg, Plotkin and Tardos for the generalized circulation problem. This new combinatorial algorithm has a worst-case complexity that is better than the complexities of the MCF and Fat-Path combinatorial algorithms of Goldberg, Plotkin and Tardos.