Linear time algorithms for linear programming

DOI10.1016/S0898-1221(99)00069-3MaRDI QIDQ1962975zbMATH OpenFDO

Authors E. A. Galperin

Publication date 20 January 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

linear time algorithmcubic algorithmasymmetric linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A new polynomial-time algorithm for linear programming
• Linear Programming in O([n3/ln n]L) Operations
• Linear Programming in Linear Time When the Dimension Is Fixed
• New algorithms for linear programming
• scientific article; zbMATH DE number 4016589

Cites work

• scientific article; zbMATH DE number 417882 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming

Cited in

(4)

• Linear approximation of execution-time constraints
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A generalized inverse method for asymptotic linear programming
• Solving Linear Programs in the Current Matrix Multiplication Time

This page was built for publication: Linear time algorithms for linear programming

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