Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation.
Peter HahnThomas GrantPublished in: Oper. Res. (1998)
Keyphrases
- quadratic assignment problem
- dual formulation
- lower bound
- upper bound
- total variation
- convex optimization
- branch and bound algorithm
- branch and bound
- primal dual
- iterative algorithms
- np hard
- lower and upper bounds
- worst case
- tabu search
- objective function
- combinatorial optimization
- lagrangian relaxation
- denoising
- optimal solution
- image restoration
- linear programming
- linear programming relaxation
- special case