Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

DOI10.1007/BF01581077zbMath0785.90066MaRDI QIDQ687079

Ilan Adler, Peter A. Beling

Publication date: 20 December 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithms; circulant matrices

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

Related Items

Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices, Polynomial algorithms for linear programming over the algebraic numbers

Cites Work

• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Polynomial algorithms for linear programming over the algebraic numbers
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Matrix Analysis
• Linear Programming in Linear Time When the Dimension Is Fixed
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Systems of distinct representatives and linear algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item