Optimization Online


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

Matthias Köppe(mkoeppe***at***math.ucdavis.edu)
Yuan Zhou(yzh***at***math.ucdavis.edu)

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.

Keywords: cut generating functions; Gomory-Johnson's infinite group relaxation; automated theorem proving

Category 1: Integer Programming (Cutting Plane Approaches )

Category 2: Optimization Software and Modeling Systems (Other )

Citation: to be presented at ISCO 2016

Download: [PDF]

Entry Submitted: 04/12/2016
Entry Accepted: 04/13/2016
Entry Last Modified: 04/12/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society