177 search results - page 1 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
MP
2010
13 years 9 days ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
JCO
1998
13 years 5 months ago
1998
MP
2006
13 years 5 months ago
2006
Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
