QSopt-Exact

swMATH5101MaRDI QIDQ17241FDOQ17241

Author name not available (Why is that?)

Cited In (17)

• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Focused most probable world computations in probabilistic logic programs
• Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• A heuristic to generate rank-1 GMI cuts
• 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
• Valid inequalities based on the interpolation procedure
• Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
• Iterative refinement for linear programming
• Using symmetry to optimize over the Sherali-Adams relaxation
• Towards an accurate solution of wireless network design problems
• Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
• Extensions of fractional precolorings show discontinuous behavior
• Exact solutions to linear programming problems
• An exact rational mixed-integer programming solver

This page was built for software: QSopt-Exact