An Improved Heuristic for the Quadratic Assignment Problem

DOI10.2307/2582509zbMath0566.90066OpenAlexW4233201443MaRDI QIDQ3682244

Colin R. Reeves

Publication date: 1985

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582509

zbMATH Keywords

quadratic assignment problemcomputational efficiencyheuristic algorithmfacility-location

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Inventory, storage, reservoirs (90B05)

Related Items

Strengthening Gilmore's bound for the quadratic assignment problem, A genetic algorithm for flowshop sequencing, An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines, An improved annealing scheme for the QAP, Parallel processing for difficult combinatorial optimization problems, Heuristic methods and applications: A categorized survey