Login / Signup

Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework.

Frédéric Roupin
Published in: Int. J. Math. Oper. Res. (2009)
Keyphrases
  • semidefinite
  • quadratic assignment problem
  • probabilistic model
  • convex relaxation
  • search algorithm
  • feature space
  • lower bound
  • multi class
  • semidefinite programming