Exact arithmetic at low cost. -- A case study in linear programming
From MaRDI portal
Recommendations
Cited in
(12)- On the efficient use of the architecture of a small computer for LP algorithms
- Exact solutions to linear programming problems
- Iterative refinement for linear programming
- scientific article; zbMATH DE number 1303552 (Why is no real title available?)
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Improving the accuracy of linear programming solvers with iterative refinement
- Exact algorithms and software in optimization and polyhedral computation
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- A generalized Sylvester identity and fraction-free random Gaussian elimination
- Exact algorithms for linear programming over algebraic extensions
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
This page was built for publication: Exact arithmetic at low cost. -- A case study in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807651)