A new bound for the quadratic assignment problem based on convex quadratic programming.
Kurt M. AnstreicherNathan W. BrixiusPublished in: Math. Program. (2001)
Keyphrases
- quadratic assignment problem
- convex quadratic programming
- lower bound
- upper bound
- tabu search
- integer linear programming formulation
- branch and bound
- worst case
- branch and bound algorithm
- combinatorial optimization
- variational inequalities
- test instances
- np hard
- neural network
- objective function
- decision trees
- high dimensional
- support vector
- optimal solution
- genetic algorithm