Date of Original Version
Abstract or Description
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.
Mathmatical Programming, 93, 123-127.