scientific article; zbMATH DE number 1532439

MaRDI QIDQ4517867zbMATH OpenFDO

Authors S. de los Cobos, Christina Goddard, Beatriz Pérez, M. Gutiérrez

Publication date 14 January 2001

zbMATH Keywords

algorithmscomputational experiencequadratic assignment problemstabu search

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Review text

From the abstract (translated from Spanish): This paper presents comparative schemes of tabu search for quadratic assignment problems. A development of three algorithms proposed in the literature is included. Computational experience are described. For the entire collection see [Zbl 0939.00030].

Recommendations

• Tabu Search Applied to the Quadratic Assignment Problem
• A tabu search algorithm for the quadratic assignment problem
• Solving the quadratic assignment problem by the repeated iterated tabu search method
• Comparison of iterative searches for the quadratic assignment problem
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem

Cited in

(6)

• Extensions of a tabu search adaptation to the quadratic assignment problem
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• Tabu Search Applied to the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• scientific article; zbMATH DE number 1296790 (Why is no real title available?)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517867)