An LP-based characterization of solvable QAP instances with chess-board and graded structures.
Lucas A. WaddellJerry L. PhillipsTianzhu LiuSwarup DharPublished in: J. Comb. Optim. (2023)
Keyphrases
- quadratic assignment problem
- board game
- np hard
- special case
- linear programming
- artificial intelligence
- lower bound
- np complete
- evaluation function
- randomly generated
- computational complexity
- linear program
- objective function
- lower and upper bounds
- computer chess
- valid inequalities
- combinatorial optimization
- tabu search
- search algorithm
- optimal solution
- bayesian networks