A faster combinatorial algorithm for the generalized circulation problem
成果类型：
Article
署名作者：
Goldfarb, D; Jin, ZY
刊物名称：
MATHEMATICS OF OPERATIONS RESEARCH
ISSN/ISSBN：
0364-765X
DOI：
10.1287/moor.21.3.529
发表日期：
1996
页码：
529-539
关键词：
摘要：
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 (1991).