Sciweavers

2 search results - page 1 / 1
» Copositivity cuts for improving SDP bounds on the clique num...
Sort
View
MP
2010
128views more  MP 2010»
13 years 3 months ago
Copositivity cuts for improving SDP bounds on the clique number
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 8 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop