2000 character limit reached
Toward computer-assisted discovery and automated proofs of cutting plane theorems
Published 13 Apr 2016 in math.OC | (1604.03649v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.