Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
Moustapha DiabyPublished in: CoRR (2006)
Keyphrases
- quadratic assignment problem
- linear programming
- integer linear programming formulation
- lower bound
- np hard
- computational complexity
- tabu search
- linear program
- combinatorial optimization
- worst case
- linear programming relaxation
- dynamic programming
- optimal solution
- neural network
- stochastic local search
- cost function
- special case
- feature space
- traveling salesman problem
- feasible solution
- integer programming
- objective function
- bayesian networks