Iterative Refinement for Linear Programming
From MaRDI portal
Publication:2830949
DOI10.1287/ijoc.2016.0692zbMath1348.90460OpenAlexW2407753303MaRDI QIDQ2830949
Daniel E. Steffy, Ambros M. Gleixner, Kati Wolter
Publication date: 1 November 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/14566f8e314f4fa44da75fb01a4191ed68a321bd
linear programmingexact computationiterative refinementrational arithmeticaccurate solutionshigh-precision optimization
Related Items
Revisiting a cutting-plane method for perfect matchings, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, Exact price of anarchy for weighted congestion games with two players, An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization, A note on the Tuza constant \(c_k\) for small \(k\), A computational status update for exact rational mixed integer programming, Solving quadratic programs to high precision using scaled iterative refinement, Linear programming using limited-precision oracles, A computational status update for exact rational mixed integer programming, Design and implementation of a modular interior-point solver for linear optimization, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Rigidity of spherical codes
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- A branch-and-cut approach to the crossing number problem
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Some perturbation theory for linear programming
- The final NETLIB-LP results
- Safe bounds in linear and mixed-integer linear programming
- Exact arithmetic at low cost. -- A case study in linear programming
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Improved WLP and GWP lower bounds based on exact integer programming
- An algorithm to solve integer linear systems exactly using numerical methods
- Exact solutions to linear programming problems
- A proof of the Kepler conjecture
- The branchwidth of graphs and their cycle matroids
- Solving Very Sparse Rational Systems of Equations
- 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
- Note sur les $Q$-matrices d’Edmonds
- Rigorous Lower and Upper Bounds in Linear Programming
- Improving the accuracy of linear programming solvers with iterative refinement
- Numeric-symbolic exact rational linear system solver
