On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem.
Moustapha DiabyPublished in: IMECS (2006)
Keyphrases
- quadratic assignment problem
- linear programming
- integer linear programming formulation
- computational complexity
- np hard
- lower bound
- combinatorial optimization
- linear programming relaxation
- tabu search
- linear program
- optimal solution
- dynamic programming
- decision problems
- np complete
- special case
- simulated annealing
- mixed integer
- test instances
- valid inequalities
- worst case
- upper bound