scientific article; zbMATH DE number 1445399

MaRDI QIDQ4952722zbMATH OpenFDO

Authors S. Thomas McCormick, Akiyoshi Shioura

Publication date 8 February 2001

zbMATH Keywords

geometric convergencelinear programmingminimum ratio canceling algorithmpolynomial time

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
• The minimum mean cycle-canceling algorithm for linear programs
• A minimum-ratio-test-free approach to linear programming
• A polynomial oracle-time algorithm for convex integer minimization
• Strong polynomial-time solvability of a minimum concave cost network flow problem.
• On the minimum norm solution of linear programs
• Polynomial Programming: LP-Relaxations Also Converge

Cited in

(3)

• The minimum mean cycle-canceling algorithm for linear programs
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
• The subset assignment problem for data placement in caches

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952722)