A FASTER COMBINATORIAL ALGORITHM FOR THE GENERALIZED CIRCULATION PROBLEM

Authors
GOLDFARB D JIN ZY
Citation
D. Goldfarb et Zy. Jin, A FASTER COMBINATORIAL ALGORITHM FOR THE GENERALIZED CIRCULATION PROBLEM, Mathematics of operations research, 21(3), 1996, pp. 529-539
Citations number
16
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics
Journal title
Mathematics of operations research → ACNP
ISSN journal
0364765X
Volume
21
Issue
3
Year of publication
1996
Pages
529 - 539
Database
ISI
SICI code
0364-765X(1996)21:3<529:AFCAFT>2.0.ZU;2-C
Abstract
This paper presents a modified version of Algorithm MCF proposed by Go ldberg, Plotkin and Tardos for the generalized circulation problem. Th is new combinatorial algorithm has a worst-case complexity that is bet ter than the complexities of the MCF and Fat-Path combinatorial algori thms of Goldberg, Plotkin, and Tardos (1991).