Back to Search Start Over

A Faster Combinatorial Algorithm for the Generalized Circulation Problem.

Authors :
Goldfarb, Donald
Zhiying Jin
Source :
Mathematics of Operations Research; Aug96, Vol. 21 Issue 3, p529, 11p
Publication Year :
1996

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 (1991). [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
COMBINATORIAL optimization
ALGORITHMS
COMBINATORICS
COMBINATORIAL geometry
MATHEMATICAL optimization
ALGEBRA

Details

Language :
English
ISSN :
0364765X
Volume :
21
Issue :
3
Database :
Complementary Index
Journal :
Mathematics of Operations Research
Publication Type :
Academic Journal
Accession number :
9704024573
Full Text :
https://doi.org/10.1287/moor.21.3.529
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details