4.6 Article

Linear programming using limited-precision oracles

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

ROUNDOFF-ERROR-FREE BASIS UPDATES OF LU FACTORIZATIONS FOR THE EFFICIENT VALIDATION OF OPTIMALITY CERTIFICATES

Adolfo R. Escobedo et al.

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2017)

Article Computer Science, Interdisciplinary Applications

Iterative Refinement for Linear Programming

Ambros M. Gleixner et al.

INFORMS JOURNAL ON COMPUTING (2016)

Article Computer Science, Interdisciplinary Applications

Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations

Adolfo R. Escobedo et al.

INFORMS JOURNAL ON COMPUTING (2015)

Article Computer Science, Software Engineering

Solving Very Sparse Rational Systems of Equations

William Cook et al.

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2011)

Article Computer Science, Theory & Methods

AN LLL ALGORITHM WITH QUADRATIC COMPLEXITY

Phong Q. Nguyen et al.

SIAM JOURNAL ON COMPUTING (2009)

Article Operations Research & Management Science

Exact solutions to linear programming problems

David L. Applegate et al.

OPERATIONS RESEARCH LETTERS (2007)

Article Computer Science, Theory & Methods

Solving linear programs with finite precision: II. Algorithms

Dennis Cheung et al.

JOURNAL OF COMPLEXITY (2006)

Article Operations Research & Management Science

The final Netlib-LP results

T Koch

OPERATIONS RESEARCH LETTERS (2004)

Article Computer Science, Theory & Methods

Acceleration of Euclidean algorithm and rational number reconstruction

XM Wang et al.

SIAM JOURNAL ON COMPUTING (2003)

Article Mathematics

How tight is Hadamard's bound?

J Abbott et al.

EXPERIMENTAL MATHEMATICS (2001)