Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
Year of publication: |
2000
|
---|---|
Authors: | Mccormick, S.Thomas ; Shioura, Akiyoshi |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 27.2000, 5, p. 199-208
|
Saved in:
Saved in favorites
Similar items by person
-
A fast bipartite network flow algorithm for selective assembly
Iwata, Satoru, (1997)
-
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
McCormick, S.Thomas, (2001)
-
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
Shigeno, Maiko, (2000)
- More ...