Mathematical Programming

On the gap between the quadratic integer programming problem and its semidefinite relaxation

U. Malik, Imad M. Jaimoukha, George D. Halikias, S. K. Gungah

Published Dec 30, 2005• 34 citations

Related papers

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

Dachuan Xu, Shu-zhong Zhang

On approximating complex quadratic optimization problems via semidefinite programming relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

Zi Li Xu, Ming-Yi Hong

Combining semidefinite and polyhedral relaxations for integer programs

Christoph Helmberg, Svatopluk Poljak, Franz Rendl +1 more