Pages that link to "Item:Q614047"
From MaRDI portal
The following pages link to Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047):
Displaying 7 items.
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)