| Article ID: | iaor20032493 |
| Country: | Germany |
| Volume: | 93 |
| Issue: | 1 |
| Start Page Number: | 123 |
| End Page Number: | 127 |
| Publication Date: | Jan 2002 |
| Journal: | Mathematical Programming |
| Authors: | Cornujols G., Li Y. |
| Keywords: | programming: integer |
In this paper, we relate several questions about cutting planes to a fundamental problem in the geometry of numbers, namely, the closest vector problem. Using this connection we show that the dominance, membership and validity problems are NP-complete for Chvátal and split cuts.