Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
From MaRDI portal
Publication:6202766
DOI10.1137/23m156046xarXiv2303.12365OpenAlexW4391881660MaRDI QIDQ6202766
Ambros M. Gleixner, Leon Eifler
Publication date: 27 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.12365
cutting planessymbolic computationsmixed-integer programmingexact computationrational arithmeticcertificate of correctness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- Certification of an optimal TSP tour through 85,900 cities
- Safe bounds in linear and mixed-integer linear programming
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- On lifted cover inequalities: a new lifting procedure with unusual properties
- New complexity results for Łukasiewicz logic
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Verifying integer programming results
- Using integer programming to search for counterexamples: a case study
- Numerical Computing with IEEE Floating Point Arithmetic
- Numerically Safe Gomory Mixed-Integer Cuts
- Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
- Integer Programming
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Cutting planes for families implying Frankl’s conjecture
- Mixed Integer Programming: Analyzing 12 Years of Progress
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Linear programming using limited-precision oracles
- A computational status update for exact rational mixed integer programming
