scientific article; zbMATH DE number 1303552
From MaRDI portal
Publication:4250176
Recommendations
Cited in
(13)- On the efficient use of the architecture of a small computer for LP algorithms
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Exact arithmetic at low cost. -- A case study in linear programming
- Which pivot to solve linear systems?
- Exact solutions to linear programming problems
- Iterative refinement for linear programming
- Solving multiscale linear programs using the simplex method in quadruple precision
- Computer-assisted proof of performance ratios for the differencing method
- Certifying feasibility and objective value of linear programs
- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
- Improving the accuracy of linear programming solvers with iterative refinement
- Exact algorithms and software in optimization and polyhedral computation
- The parallel simplex-method achievements for errorless solving of linear programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250176)