Solving Large Quadratic Assignment Problems in Parallel

@article{Clausen1997SolvingLQ,
title={Solving Large Quadratic Assignment Problems in Parallel},
author={Jens Clausen and Michael Perregaard},
journal={Comp. Opt. and Appl.},
year={1997},
volume={8},
pages={111-127}
}

Quadratic Assignment problems are in practice among the most diicult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space searched. Much work has been done to identify such functions for the QAP, but with limited success. Parallel processing has also been used in order to increase the size of problems solvable toâ€¦Â CONTINUE READING