QSopt_ex

swMATH4722MaRDI QIDQ16890FDOQ16890

Author name not available (Why is that?)

Cited In (25)

• Restricted risk measures and robust optimization
• A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
• Improving the accuracy of linear programming solvers with iterative refinement
• Using massively parallel computations for absolutely precise solution of the linear programming problems
• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• Local cuts for mixed-integer programming
• 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
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• On the safety of Gomory cut generators
• 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
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
• 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
• Iterative refinement for linear programming
• Using symmetry to optimize over the Sherali-Adams relaxation
• Towards an accurate solution of wireless network design problems
• Verifying integer programming results
• 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