Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
From MaRDI portal
Publication:1662113
DOI10.1016/j.disopt.2017.10.001zbMath1506.90213arXiv1608.07647MaRDI QIDQ1662113
Tunçel, Levent, Yu Hin (Gary) Au
Publication date: 17 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07647
integer programming; semidefinite programming; combinatorial optimization; convex relaxations; integrality gap; lift-and-project methods
90C22: Semidefinite programming
90C10: Integer programming
90C27: Combinatorial optimization
90C09: Boolean programming