A SIMPLE INTRODUCTION TO HIGHER ORDER LIFTINGS FOR BINARY PROBLEMS

被引:0
|
作者
Jarre, Florian [1 ]
机构
[1] Heinrich Heine Univ Dusseldorf, Math Inst, D-40225 Dusseldorf, Germany
来源
PACIFIC JOURNAL OF OPTIMIZATION | 2023年 / 19卷 / 03期
关键词
binary problems; higher order liftings; MAX-CUT; RELAXATIONS; OPTIMIZATION; MATRICES;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A short, simple, and self-contained proof is presented showing that n-th lifting for the max-cut-polytope is exact. The proof re-derives the known observations that the max-cut-polytope is the projection of a higher-dimensional regular simplex and that this simplex coincides with the n-th semidefinite lifting. An extension to reduce the dimension of higher order liftings and to include linear equality and inequality constraints concludes this paper
引用
收藏
页码:411 / 421
页数:11
相关论文
共 50 条