Lecture notes in computer science

Combining semidefinite and polyhedral relaxations for integer programs

Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

Published Jan 1, 1995• 28 citations

Related papers

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

U. Malik, Imad M. Jaimoukha, George D. Halikias +1 more

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program

Agnès Gorge, Abdel Lisser, Riadh Zorgati

On approximating complex quadratic optimization problems via semidefinite programming relaxations

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

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

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