A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique.
Peter M. HahnMatthew J. SaltzmanPublished in: Stud. Inform. Univ. (2010)
Keyphrases
- branch and bound
- quadratic assignment problem
- lower bound
- combinatorial optimization
- branch and bound algorithm
- tree search
- upper bound
- search algorithm
- optimal solution
- column generation
- branch and bound procedure
- metaheuristic
- tabu search
- linear programming relaxation
- beam search
- search strategies
- np hard
- mathematical programming
- max sat
- search space
- combinatorial optimization problems
- lagrangian relaxation
- objective function
- stochastic local search
- randomly generated
- simulated annealing
- lower and upper bounds
- partial solutions
- exact solution
- aco algorithm
- scheduling problem
- constraint satisfaction
- heuristic search