A computational status update for exact rational mixed integer programming
From MaRDI portal
Publication:5918427
DOI10.1007/978-3-030-73879-2_12zbMath1482.90125arXiv2101.09141OpenAlexW3164629737MaRDI QIDQ5918427
Leon Eifler, Ambros M. Gleixner
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.09141
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Safe bounds in linear and mixed-integer linear programming
- Branching rules revisited
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- New complexity results for Łukasiewicz logic
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Computing convex hulls and counting integer points with \texttt{polymake}
- Verifying integer programming results
- Measuring the impact of primal heuristics
- Exact solutions to linear programming problems
- Using integer programming to search for counterexamples: a case study
- Iterative Refinement for Linear Programming
- Numerically Safe Gomory Mixed-Integer Cuts
- Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Presolve Reductions in Mixed Integer Programming
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
- Accuracy and Stability of Numerical Algorithms
- Cutting planes for families implying Frankl’s conjecture
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Linear programming using limited-precision oracles
