Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems

@inproceedings{Kppe2016TowardCD,
  title={Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems},
  author={Matthias K{\"o}ppe and Yuan Zhou},
  booktitle={ISCO},
  year={2016}
}
Using a metaprogramming technique and semialgebraic computations, we provide computer-based proofs for old and new cutting-plane theorems in Gomory--Johnson's model of cut generating functions. 
Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case
We present software for investigations with cut-generating functions in the Gomory–Johnson model and extensions, implemented in the computer algebra system SageMath.
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse semigroup theory, closures, decomposition of perturbations
In this self-contained paper, we present a theory of the piecewise linear minimal valid functions for the 1-row Gomory-Johnson infinite group problem. The non-extreme minimal valid functions are
Equivariant perturbation in Gomory and Johnson’s infinite group problem—III: foundations for the k-dimensional case with applications to $$k=2$$k=2
TLDR
The general regular solution to Cauchy’s additive functional equation on restricted lower-dimensional convex domains provides a k-dimensional generalization of the so-called Interval Lemma, allowing us to deduce affine properties of the function from certain additivity relations.

References

SHOWING 1-10 OF 33 REFERENCES
New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem
We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles
A FORMAL PROOF OF THE KEPLER CONJECTURE
TLDR
This paper constitutes the official published account of the now completed Flyspeck project and describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants.
Some continuous functions related to corner polyhedra
TLDR
It is shown how faces previously generated and those given here can be used to give valid inequalities for any integer program.
Valid inequalities for MIPs and group polyhedra from approximate liftings
TLDR
This scheme uses superadditive functions as the building block of integer and continuous lifting procedures and yields a simple derivation of new and known families of cuts that correspond to extreme inequalities for group problems.
On the group problem for mixed integer programming
A theory is developed for a group problem arising from mixed integer programming. This theory gives descriptions of functions on the unit hypercube from which cutting planes can be constructed for
An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
Algorithms in real algebraic geometry
TLDR
This chapter discusses computing roadmaps and Connected Components of Algebraic Sets, as well as the "complexity of Basic Algorithms" and "cylindrical Decomposition Algorithm".
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
TLDR
An algorithm for testing the extremality of minimal valid functions for Gomory and Johnson's infinite group problem that are piecewise linear possibly discontinuous with rational breakpoints and an extreme function, whose extremality follows from a new principle is presented.
T-space and cutting planes
TLDR
It is shown how knowledge about T-space translates directly into cutting planes for general integer programming problems, and a variety of constructions for T- space facets are given, all of which translate intocutting planes, and continuous families of facets are introduced.
...
...