QSopt_ex

swMATH4722MaRDI QIDQ16890

No author found.

Related Items (26)

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization ⋮ Restricted risk measures and robust optimization ⋮ Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision ⋮ Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method ⋮ Local cuts for mixed-integer programming ⋮ Verifying integer programming results ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars ⋮ Could we use a million cores to solve an integer program? ⋮ Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ An Exact Rational Mixed-Integer Programming Solver ⋮ Exact solutions to linear programming problems ⋮ New benchmark instances for the capacitated vehicle routing problem ⋮ Using massively parallel computations for absolutely precise solution of the linear programming problems ⋮ Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry ⋮ Rigorous Error Bounds for the Optimal Value in Semidefinite Programming ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ Linear programming using limited-precision oracles ⋮ On the safety of Gomory cut generators ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes ⋮ Iterative Refinement for Linear Programming ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work ⋮ Towards an Accurate Solution of Wireless Network Design Problems ⋮ Improving the accuracy of linear programming solvers with iterative refinement

This page was built for software: QSopt_ex