Pages that link to "Item:Q2830949"
From MaRDI portal
The following pages link to Iterative Refinement for Linear Programming (Q2830949):
Displaying 14 items.
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
- Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← 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)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
- A note on the Tuza constant \(c_k\) for small \(k\) (Q6184535) (← links)
- A practitioner's guide to MDP model checking algorithms (Q6535370) (← links)
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization (Q6596332) (← links)
- Extending the fundamental theorem of linear programming for strict inequalities (Q6666552) (← links)
