scientific article; zbMATH DE number 16591

MaRDI QIDQ3973277zbMATH OpenFDO

Authors Nimrod Megiddo

Publication date 26 June 1992

zbMATH Keywords

approximate solutions

Mathematics Subject Classification ID

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

Cited in

(11)

• Polynomial algorithms for linear programming over the algebraic numbers
• Solving linear programming problems exactly
• Potential function methods for approximately solving linear programming problems: theory and practice.
• The equivalence of linear programs and zero-sum games
• On the adjustment problem for linear programs
• On Chubanov's Method for Linear Programming
• scientific article; zbMATH DE number 3858835 (Why is no real title available?)
• scientific article; zbMATH DE number 1099078 (Why is no real title available?)
• Linear Programming Isn't Always the Answer
• Solving linear optimization problems on arrangements by the truncation method
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

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 Q3973277)