A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem.
Yichuan DingHenry WolkowiczPublished in: Math. Oper. Res. (2009)
Keyphrases
- semidefinite
- quadratic assignment problem
- low dimensional
- higher dimensional
- high dimensional
- lower bound
- semidefinite programming
- convex relaxation
- high dimensional data
- dimensionality reduction
- euclidean space
- tabu search
- principal component analysis
- combinatorial optimization
- feature space
- interior point methods
- data points
- input space
- sufficient conditions
- convex sets
- test instances
- machine learning
- training data
- pairwise
- upper bound
- convex optimization
- multi class
- linear programming