A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
From MaRDI portal
(Redirected from Publication:5883707)
Cites work
- A de Bruijn-Erdős theorem in graphs?
- A formal proof of the Kepler conjecture
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A new result on Chvátal's conjecture
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Combinatorial Optimization Problems for Systems of Subsets
- Computing convex hulls and counting integer points with \texttt{polymake}
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Exact solutions to linear programming problems
- Great intersecting families of edges in hereditary hypergraphs
- scientific article; zbMATH DE number 3477224 (Why is no real title available?)
- scientific article; zbMATH DE number 3477225 (Why is no real title available?)
- scientific article; zbMATH DE number 3506745 (Why is no real title available?)
- scientific article; zbMATH DE number 3619902 (Why is no real title available?)
- scientific article; zbMATH DE number 1792287 (Why is no real title available?)
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Mixed integer programming: analyzing 12 years of progress
- New upper bounds for kissing numbers from semidefinite programming
- On Chvatal's conjecture related to a hereditary system
- On Chvàtal's conjecture and a conjecture on families of signed sets
- On the combinatorial problems which I would most like to see solved
- Short proof of two cases of Chvátal's conjecture
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- The traveling salesman problem. A computational study.
- Using integer programming to search for counterexamples: a case study
- Verifying integer programming results
Cited in
(6)- ChvatalIP
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- A Safe Computational Framework for Integer Programming applied to Chv\'atal's Conjecture
- Local Configurations in Union-Closed Families
- Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
- Satisfiability modulo theories for verifying MILP certificates
This page was built for publication: A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883707)
