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

DOI10.1007/BF01581077MaRDI QIDQ687079zbMATH OpenOpenAlexFDO

Authors Ilan Adler, Peter A. Beling

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

circulant matricespolynomial algorithms

Mathematics Subject Classification ID

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

Recommendations

• Polynomial algorithms for linear programming over the algebraic numbers
• A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
• Polynomial algorithms for m (m+1) integer programs and m (m+k) diophantine systems
• Algorithmic properties of polynomial rings
• scientific article; zbMATH DE number 4077322
• scientific article; zbMATH DE number 1294381
• Asymptotically exact polynomial algorithms in integer linear programming
• scientific article; zbMATH DE number 4181141
• Efficient polynomial algorithms for distributive lattices
• Polynomial algorithms for computing the permanents of some matrices

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 432784 (Why is no real title available?)
• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 16591 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3392542 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• 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
• Linear Programming in Linear Time When the Dimension Is Fixed
• Matrix Analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• 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
• Systems of distinct representatives and linear algebra
• Towards a Genuinely Polynomial Algorithm for Linear Programming

Cited in

(3)

• 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
• Polynomial algorithms for m (m+1) integer programs and m (m+k) diophantine systems

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

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