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

DOI10.1007/BF01581077zbMath0785.90066OpenAlexW1999692791MaRDI QIDQ687079

Peter A. Beling, Ilan Adler

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1007/bf01581077

zbMATH Keywords

polynomial algorithmscirculant matrices

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices