Abstract
The question as to whether the Gomory-Chvátal closure of a nonrational polytope is a polytope has been a longstanding open problem in integer programming. In this paper, we answer this question in the affirmative by combining ideas from polyhedral theory and the geometry of numbers.
| Original language | English |
|---|---|
| Pages (from-to) | 63-91 |
| Number of pages | 29 |
| Journal | Mathematics of Operations Research |
| Volume | 38 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2013 |
| Externally published | Yes |
Keywords
- Cutting planes
- Gomory-chvátal closure
- Integer programming