Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.
Mauricio G. C. ResendeK. G. RamakrishnanZvi DreznerPublished in: Oper. Res. (1995)
Keyphrases
- quadratic assignment problem
- algorithm for linear programming
- interior point
- lower bound
- primal dual
- linear programming
- interior point methods
- linear program
- upper bound
- np hard
- convex optimization
- approximation algorithms
- optimal solution
- semidefinite programming
- tabu search
- objective function
- branch and bound algorithm
- convergence rate
- lower and upper bounds
- worst case
- feasible solution
- branch and bound
- combinatorial optimization
- linear programming relaxation
- learning algorithm
- column generation
- test instances
- stochastic local search
- integer programming
- image restoration
- semidefinite
- special case
- bayesian networks