SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
From MaRDI portal
Recommendations
Cites work
- A greedy genetic algorithm for the quadratic assignment problem
- A new genetic algorithm for the quadratic assignment problem
- A survey for the quadratic assignment problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- An improved tabu search heuristic for solving facility layout design problems
- Ant colony optimization for solving an industrial layout problem
- Comparison of iterative searches for the quadratic assignment problem
- COSEARCH: A parallel cooperative metaheuristic
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Massively parallel tabu search for the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Quadratic assignment problem QAP with adaptable material handling devices
- Solving the facility and layout and location problem by ant-colony optimization-meta heuristic
- Tabu Search—Part I
Cited in
(2)
This page was built for publication: SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163728)