ARTICLES - An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
Year of publication: |
1999
|
---|---|
Authors: | Goldfarb, Donald ; Jin, Zhiying |
Published in: |
Operations research : the journal of the Operations Research Society of America. - Linthicum, Md : INFORMS, ISSN 0030-364X, ZDB-ID 1233890. - Vol. 47.1999, 3, p. 445-448
|
Saved in:
Saved in favorites
Similar items by person
-
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Goldfarb, Donald, (1997)
-
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Goldfarb, Donald, (1996)
-
Optimal sequential designs for on-line item estimation
Jones, Douglas, (1994)
- More ...