Exact solutions to linear programming problems
From MaRDI portal
(Redirected from Publication:2467437)
Recommendations
Cites work
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A linear programming bound for orthogonal arrays with mixed levels
- An efficient algorithm for the minimum capacity cut problem
- Data Structures for Traveling Salesmen
- Exact arithmetic at low cost. -- A case study in linear programming
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Rigorous Lower and Upper Bounds in Linear Programming
- Safe bounds in linear and mixed-integer linear programming
- Solving sparse linear equations over finite fields
- The final NETLIB-LP results
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
Cited in
(48)- Testing cut generators for mixed-integer linear programming
- Improving the accuracy of linear programming solvers with iterative refinement
- scientific article; zbMATH DE number 4166931 (Why is no real title available?)
- A revised simplex method with integer Q-matrices
- scientific article; zbMATH DE number 5811179 (Why is no real title available?)
- scientific article; zbMATH DE number 1543280 (Why is no real title available?)
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- Solving very sparse rational systems of equations
- Integral approximation of rays and verification of feasibility
- scientific article; zbMATH DE number 1303552 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- Local cuts for mixed-integer programming
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Solving linear programming problems exactly
- 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
- Certifying feasibility and objective value of linear programs
- Algorithms for finding generalized minimum aberration designs
- A duality-based method for identifying elemental balance violations in metabolic network models
- 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
- The final NETLIB-LP results
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Exact algorithms and software in optimization and polyhedral computation
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Revisiting a cutting-plane method for perfect matchings
- On the exact separation of mixed integer knapsack cuts
- Computing linear extensions for polynomial posets subject to algebraic constraints
- A computational status update for exact rational mixed integer programming
- Solving multiscale linear programs using the simplex method in quadruple precision
- scientific article; zbMATH DE number 3903854 (Why is no real title available?)
- Certifying algorithms
- Iterative refinement for linear programming
- Maximum-weight stable sets and safe lower bounds for graph coloring
- 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
- An exact rational mixed-integer programming solver
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- Improved WLP and GWP lower bounds based on exact integer programming
- Numerically safe lower bounds for the capacitated vehicle routing problem
Describes a project that uses
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)
