Abstract
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.
Cite
CITATION STYLE
APA
Helmberg, C., Rendl, F., & Weismantel, R. (1996). Quadratic knapsack relaxations using cutting planes and semidefinite programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1084, pp. 175–189). Springer Verlag. https://doi.org/10.1007/3-540-61310-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free