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

Matthias Köppe, Yuan Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Using a metaprogramming technique and semialgebraic computations, we provide computer-based proofs for old and new cuttingplane theorems in Gomory-Johnson’s model of cut generating functions.

Original languageEnglish
Title of host publicationCombinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers
EditorsSatoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli
Pages332-344
Number of pages13
DOIs
StatePublished - 2016
Event4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, Italy
Duration: May 16 2016May 18 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9849 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Symposium on Combinatorial Optimization, ISCO 2016
Country/TerritoryItaly
CityVietri sul Mare
Period5/16/165/18/16

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2016.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Toward computer-assisted discovery and automated proofs of cutting plane theorems'. Together they form a unique fingerprint.

Cite this