Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

Authors:
S. Thomas McCormick;Akiyoshi Shioura
Affiliations:
Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada and SORIE at Cornell University;Department of Mechanical Engineering, Sophia University, 7-1 Kioi-cho, Chiyoda-ku, Tokyo 102-8554, Japan and Faculty of Commerce and Business Administration, University of British Columbia
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 12
Cited 0

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
Theory of linear and integer programming

Theory of linear and integer programming
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Note on Weintraub's minimum-cost circulation algorithm

SIAM Journal on Computing
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Two strongly polynomial cut cancelling algorithms for minimum cost network flow

Discrete Applied Mathematics
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

SIAM Journal on Computing
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
A polynomial combinatorial algorithm for generalized minimum cost flow

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract