Copositive and semidefinite relaxations of the quadratic assignment problem.

Janez Povh Franz Rendl

Published in: Discret. Optim. (2009)

Keyphrases

semidefinite
quadratic assignment problem
semidefinite programming
lower bound
tabu search
convex relaxation
sufficient conditions
combinatorial optimization
interior point methods
higher dimensional
test instances
convex sets
linear programming
stochastic local search
feature selection
k nearest neighbor