Cited in
(29)- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Exact solutions to linear programming problems
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- An exact rational mixed-integer programming solver
- Algorithm 529
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Givaro
- IML - Integer Matrix Library
- SoPlex
- QSopt_ex
- QSopt
- Cgllandp
- ProbView
- COLMOD
- SPQR_RANK
- MIQPlib
- Performance Libraries
- Iterative refinement for linear programming
- Valid inequalities based on the interpolation procedure
- Extensions of fractional precolorings show discontinuous behavior
- Using symmetry to optimize over the Sherali-Adams relaxation
- Towards an accurate solution of wireless network design problems
- Focused most probable world computations in probabilistic logic programs
- A heuristic to generate rank-1 GMI cuts
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
This page was built for software: QSopt-Exact
