A connection between cutting plane theory and the geometry of numbers
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 Chvatal and split cuts.
closest vector problem validity problem split cut dominance problem membership problem chvatal cut disjunctive cut gomory cut