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 language | English |
---|---|
Title of host publication | Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers |
Editors | Satoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli |
Pages | 332-344 |
Number of pages | 13 |
DOIs | |
State | Published - 2016 |
Event | 4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, Italy Duration: May 16 2016 → May 18 2016 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9849 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 4th International Symposium on Combinatorial Optimization, ISCO 2016 |
---|---|
Country/Territory | Italy |
City | Vietri sul Mare |
Period | 5/16/16 → 5/18/16 |
Bibliographical note
Publisher Copyright:© Springer International Publishing Switzerland 2016.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science