An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
From MaRDI portal
Publication:621965
DOI10.1016/j.ejor.2010.09.009zbMath1208.90106arXiv1009.4880OpenAlexW2155662647MaRDI QIDQ621965
Publication date: 31 January 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.4880
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A distance based rule for removing population members in genetic algorithms
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- A complexity O(1) priority queue for event driven molecular dynamics simulations
- Mapping the convergence of genetic algorithms
- Extensions of a tabu search adaptation to the quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
- Recent advances in the solution of quadratic assignment problems
- A tabu search algorithm for the quadratic assignment problem
- The extended concentric tabu for the quadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Compounded genetic algorithms for the quadratic assignment problem
- A New Genetic Algorithm for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Algorithm 769
- Measuring cache and TLB performance and their effect on benchmark runtimes
- Gender-Specific Genetic Algorithms*
This page was built for publication: An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
