Date of Original Version

3-2002

Type

Article

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.

DOI

10.1007/s10107-002-0302-5

Share

COinS
 

Published In

Mathmatical Programming, 93, 123-127.