Toward computer-assisted discovery and automated proofs of cutting plane theorems

Abstract

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.

21 pages, 11 figures; to be presented at ISCO 2016

References in corpus (3)

• Light on the Infinite Group Relaxation
• Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
• An Electronic Compendium of Extreme Functions for the Gomory--Johnson Infinite Group Problem

Cited by in corpus (2)

• Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse semigroup theory, closures, decomposition of perturbations
• Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. V. Software for the continuous and discontinuous 1-row case