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
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Implementation of a parallel Branch and Bound algorithm for Quadratic Assignment problems on a 16 processor MEIKO i860 Hypercube

  • J Clausen, M Perregaard
  • Tech. Report
  • 1994

Trr aa, Implementation of parallel Branch-and-Bound algorithms -experiences with the graph partitioning problem

  • J Clausen
  • Annals of Oper. Res
  • 1991

Similar Papers

Loading similar papers…