Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming.
Hans D. MittelmannJiming PengPublished in: SIAM J. Optim. (2010)
Keyphrases
- semidefinite programming
- quadratic assignment problem
- manhattan distance
- lower bound
- linear programming
- upper bound
- euclidean distance
- hamming distance
- semidefinite
- primal dual
- tabu search
- distance measure
- kernel matrix
- optimal solution
- distance metric
- combinatorial optimization
- np hard
- maximum margin
- worst case
- supervised learning
- data sets
- approximation algorithms
- computational complexity
- feature selection
- neural network