Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Year of publication: |
1997
|
---|---|
Authors: | Goldfarb, Donald ; Jin, Zhiying ; Orlin, James B. |
Published in: |
Mathematics of operations research. - Linthicum, Md : Inst, ISSN 0364-765X, ZDB-ID 1956838. - Vol. 22.1997, 4, p. 793-802
|
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)
-
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Goldfarb, Donald, (1996)
-
Optimal sequential designs for on-line item estimation
Jones, Douglas, (1994)
- More ...