Expediting exact linear programming solvers via integer preserving factorization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- An exact rational mixed-integer programming solver
- Benchmarking optimization software with performance profiles.
- Combining precision boosting with LP iterative refinement for exact linear optimization
- Direct Methods for Sparse Linear Systems
- Error analysis of floating-point computation
- Exact and fast algorithms for mixed-integer nonlinear programming
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Iterative refinement for linear programming
- MPFR
- On the minimum FLOPs problem in the sparse Cholesky factorization
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Solution of dense linear systems via roundoff-error-free factorization algorithms. Theoretical connections and computational comparisons
- Solving very sparse rational systems of equations
- The final NETLIB-LP results
This page was built for publication: Expediting exact linear programming solvers via integer preserving factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233040)
