Sciweavers

64 search results - page 1 / 13
» Integer Quadratic Quasi-polyhedra
Sort
View
MP
2006
113views more  MP 2006»
13 years 4 months ago
On the gap between the quadratic integer programming problem and its semidefinite relaxation
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....
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 2 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
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
IPCO
2010
146views Optimization» more  IPCO 2010»
13 years 6 months ago
Integer Quadratic Quasi-polyhedra
Adam N. Letchford