Exact solutions to linear programming problems
From MaRDI portal
Publication:2467437
DOI10.1016/J.ORL.2006.12.010zbMATH Open1177.90282DBLPjournals/orl/ApplegateCDE07OpenAlexW2109742527WikidataQ95137695 ScholiaQ95137695MaRDI QIDQ2467437FDOQ2467437
Authors: William Cook, Sanjeeb Dash, David Applegate, Daniel G. Espinoza 
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.12.010
Recommendations
Cites Work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Solving sparse linear equations over finite fields
- The final NETLIB-LP results
- Safe bounds in linear and mixed-integer linear programming
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
- An efficient algorithm for the minimum capacity cut problem
- A linear programming bound for orthogonal arrays with mixed levels
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Data Structures for Traveling Salesmen
- Title not available (Why is that?)
- Rigorous Lower and Upper Bounds in Linear Programming
- Exact arithmetic at low cost. -- A case study in linear programming
Cited In (48)
- Testing cut generators for mixed-integer linear programming
- Improving the accuracy of linear programming solvers with iterative refinement
- A revised simplex method with integer Q-matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear programming using limited-precision oracles
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- Solving very sparse rational systems of equations
- Title not available (Why is that?)
- Integral approximation of rays and verification of feasibility
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Local cuts for mixed-integer programming
- The parallel simplex-method achievements for errorless solving of linear programming problems
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Solving linear programming problems exactly
- A duality-based method for identifying elemental balance violations in metabolic network models
- Certifying feasibility and objective value of linear programs
- Algorithms for finding generalized minimum aberration designs
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On the safety of Gomory cut generators
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- A computational status update for exact rational mixed integer programming
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- The final NETLIB-LP results
- Exact algorithms and software in optimization and polyhedral computation
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- A computational status update for exact rational mixed integer programming
- Computing linear extensions for polynomial posets subject to algebraic constraints
- Revisiting a cutting-plane method for perfect matchings
- Solving multiscale linear programs using the simplex method in quadruple precision
- On the exact separation of mixed integer knapsack cuts
- Title not available (Why is that?)
- Iterative refinement for linear programming
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Certifying algorithms
- Safe lower bounds for graph coloring
- Computational experience with general cutting planes for the set covering problem
- A review of computation of mathematically rigorous bounds on optima of linear programs
- On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
- Normal solutions of linear programs
- Rigidity of spherical codes
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- An exact rational mixed-integer programming solver
- Improved WLP and GWP lower bounds based on exact integer programming
- Numerically safe lower bounds for the capacitated vehicle routing problem
Uses Software
This page was built for publication: Exact solutions to linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467437)
