6 search results - page 1 / 2 » Exploiting group symmetry in semidefinite programming relaxa... |
MP
2010
12 years 11 months 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 4 months ago
1998
SIAMJO
2010
12 years 11 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...