A study of diversification strategies for the quadratic assignment problem
- 31 October 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (8) , 885-893
- https://doi.org/10.1016/0305-0548(94)90018-3
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Extensions of a tabu search adaptation to the quadratic assignment problemComputers & Operations Research, 1994
- Solving the maximum clique problem using a tabu search approachAnnals of Operations Research, 1993
- Integrating target analysis and tabu search for improved scheduling systemsExpert Systems with Applications, 1993
- Bandwidth Packing: A Tabu Search ApproachManagement Science, 1993
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Tabu Search Applied to the Quadratic Assignment ProblemINFORMS Journal on Computing, 1990
- Algorithms for assignment problems on an array processorParallel Computing, 1989
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957