The Quadratic Assignment Problem is easy for Robinsonian Matrices.

Monique Laurent Matteo Seminaroti

Published in: CoRR (2014)

Keyphrases

branch and bound algorithm
quadratic assignment problem
lower bound
combinatorial optimization
test problems
test instances
integer linear programming formulation
simulated annealing
metaheuristic
genetic algorithm
optimization problems
tabu search
bayesian networks
multi objective
stochastic local search