A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Published Online:1 Aug 1996https://doi.org/10.1287/moor.21.3.529
Abstract
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 (Goldberg, A. V., S. A. Plotkin, E. Tardos. 1991. Combinatorial algorithms for the generalized circulation problem. Math. Oper. Res.16 351–379.).
