Iterative refinement for linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A branch-and-cut approach to the crossing number problem
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A proof of the Kepler conjecture
- An algorithm to solve integer linear systems exactly using numerical methods
- An exact rational mixed-integer programming solver
- Computing the crosscap number of a knot using integer programming and normal surfaces
- Exact Solution of Systems of Linear Equations with Iterative Methods
- Exact arithmetic at low cost. -- A case study in linear programming
- Exact solutions to linear programming problems
- Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
- Improved WLP and GWP lower bounds based on exact integer programming
- Improving the accuracy of linear programming solvers with iterative refinement
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Note sur les $Q$-matrices d’Edmonds
- Numeric-symbolic exact rational linear system solver
- Rigidity of spherical codes
- Rigorous Lower and Upper Bounds in Linear Programming
- Safe bounds in linear and mixed-integer linear programming
- Solving very sparse rational systems of equations
- Some perturbation theory for linear programming
- The branchwidth of graphs and their cycle matroids
- The final NETLIB-LP results
Cited in
(21)- scientific article; zbMATH DE number 4213737 (Why is no real title available?)
- Improving the accuracy of linear programming solvers with iterative refinement
- scientific article; zbMATH DE number 1303552 (Why is no real title available?)
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Exact price of anarchy for weighted congestion games with two players
- Iterative linear programming solution of convex programs
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
- Accurate linear cutting-plane relaxations for ACOPF
- A note on the Tuza constant \(c_k\) for small \(k\)
- Expediting exact linear programming solvers via integer preserving factorization
- A computational status update for exact rational mixed integer programming
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Revisiting a cutting-plane method for perfect matchings
- A computational status update for exact rational mixed integer programming
- Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
- Towards an accurate solution of wireless network design problems
- Solving quadratic programs to high precision using scaled iterative refinement
- Extending the fundamental theorem of linear programming for strict inequalities
- A practitioner's guide to MDP model checking algorithms
- Design and implementation of a modular interior-point solver for linear optimization
This page was built for publication: Iterative refinement for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830949)
