The following pages link to QSopt-Exact (Q17241):
Displaying 18 items.
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
- Valid inequalities based on the interpolation procedure (Q2490327) (← links)
- Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations (Q2802247) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry (Q5963080) (← links)
