Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers.
Huizhen ZhangCesar Beltran-RoyoLiang MaPublished in: Ann. Oper. Res. (2013)
Keyphrases
- quadratic assignment problem
- mixed integer linear programming
- combinatorial optimization
- branch and bound algorithm
- lower bound
- mathematical programming
- cutting plane
- stochastic local search
- tabu search
- branch and bound
- test instances
- simulated annealing
- sat instances
- test problems
- randomly generated
- aco algorithm
- production planning
- genetic algorithm
- sat solvers
- optimization problems
- multi objective
- feature space