QSopt_ex
From MaRDI portal
QSopt ex
Cited in
(46)- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
- Restricted risk measures and robust optimization
- Improving the accuracy of linear programming solvers with iterative refinement
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- Local cuts for mixed-integer programming
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Could we use a million cores to solve an integer program?
- New benchmark instances for the capacitated vehicle routing problem
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Givaro
- IML - Integer Matrix Library
- SoPlex
- QSopt-Exact
- mkc7
- Lamatto
- COLMOD
- GCG
- SPQR_RANK
- EGlib
- CuSPLIB
- libquadmath
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On the safety of Gomory cut generators
- MULTILSB
- pPCx
- VIPR
- Arrow Gibbard Satterthwaite
- Social Choice Theory
- Stable Matching
- Performance Libraries
- cuboids-code
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Solving multiscale linear programs using the simplex method in quadruple precision
- Using symmetry to optimize over the Sherali-Adams relaxation
- Iterative refinement for linear programming
- Towards an accurate solution of wireless network design problems
- Verifying integer programming results
- Algorithm 529
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Exact solutions to linear programming problems
- An exact rational mixed-integer programming solver
This page was built for software: QSopt_ex
