A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Year of publication: |
1996
|
---|---|
Authors: | Goldfarb, Donald ; Jin, Zhiying |
Published in: |
Mathematics of operations research. - Linthicum, Md : Inst, ISSN 0364-765X, ZDB-ID 1956838. - Vol. 21.1996, 3, p. 529-539
|
Saved in:
Saved in favorites
Similar items by person
-
ARTICLES - An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
Goldfarb, Donald, (1999)
-
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Goldfarb, Donald, (1997)
-
Optimal sequential designs for on-line item estimation
Jones, Douglas, (1994)
- More ...