Semidefinite programming approach for the quadratic assignment problem with a sparse graph.
José F. S. Bravo FerreiraYuehaw KhooAmit SingerPublished in: Comput. Optim. Appl. (2018)
Keyphrases
- semidefinite programming
- quadratic assignment problem
- linear programming
- lower bound
- semidefinite
- tabu search
- kernel matrix
- primal dual
- high dimensional
- linear program
- test instances
- combinatorial optimization
- evolutionary algorithm
- stochastic local search
- neural network
- maximum margin
- k nearest neighbor
- training data
- machine learning