A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
From MaRDI portal
Publication:5883707
DOI10.1145/3485630OpenAlexW3211222374WikidataQ113309852 ScholiaQ113309852MaRDI QIDQ5883707
Leon Eifler, Ambros M. Gleixner, Jonad Pulaj
Publication date: 22 March 2023
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.01572
Related Items
ChvatalIP ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Chvàtal's conjecture and a conjecture on families of signed sets
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Great intersecting families of edges in hereditary hypergraphs
- On the combinatorial problems which I would most like to see solved
- On Chvatal's conjecture related to a hereditary system
- A new result on Chvátal's conjecture
- Short proof of two cases of Chvátal's conjecture
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Computing convex hulls and counting integer points with \texttt{polymake}
- Verifying integer programming results
- A de Bruijn-Erdős theorem in graphs?
- Exact solutions to linear programming problems
- Using integer programming to search for counterexamples: a case study
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Combinatorial Optimization Problems for Systems of Subsets
- New upper bounds for kissing numbers from semidefinite programming
- Mixed Integer Programming: Analyzing 12 Years of Progress
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
