Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

MP
2006

favoriteEmaildiscussreport

113views more MP 2006»

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

13 years 4 months ago

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

Download www.staff.city.ac.uk

Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:

U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K.

Real-time Traffic

MP 2006 | Quadratic Integer | Relaxation Problem | Semidefinite Relaxation |

claim paper

Related Content

» Approximation of Canonical Sets and Their Applications to 2D View Simplification

» Grothendieck inequalities for semidefinite programs with rank constraint

» On linear and semidefinite programming relaxations for hypergraph matching

» Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming

» On Quadratic Programming with a Ratio Objective

» Convex relaxation approach to the identification of the WienerHammerstein model

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

» Ensemble Pruning Via Semidefinite Programming

» Optimal solutions for unrelated parallel machines scheduling problems using convex quadrat...

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	MP
Authors	U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K. Gungah

Comments (0)