Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
From MaRDI portal
Publication:2835688
DOI10.1007/978-3-319-45587-7_29zbMath1445.68329arXiv1604.03649OpenAlexW2340911864MaRDI QIDQ2835688
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.03649
Integer programming (90C10) Mixed integer programming (90C11) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations
Uses Software
Cites Work
- Light on the infinite group relaxation. I: Foundations and taxonomy
- The seventeen provers of the world. Foreword by Dana S. Scott..
- On the extreme inequalities of infinite group problems
- Valid inequalities for mips and group polyhedra from approximate liftings
- Every planar map is four colorable. I: Discharging
- T-space and cutting planes
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- A proof of the Kepler conjecture
- New inequalities for finite and infinite group problems from approximate lifting
- QEPCAD B
- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
- Cut-Generating Functions and S-Free Sets
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Algorithms in real algebraic geometry
