A connection between cutting plane theory and the geometry of numbers

被引:7
|
作者
Cornuéjols, G [1 ]
Li, YJ [1 ]
机构
[1] Carnegie Mellon Univ, Grad Sch Ind Adm, Pittsburgh, PA 15213 USA
关键词
closest vector problem; dominance problem; membership problem; validity problem; Chvatal cut; split cut; disjunctive cut; Gomory cut;
D O I
10.1007/s10107-002-0302-5
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:123 / 127
页数:5
相关论文
共 50 条