Pages that link to "Item:Q1773110"
From MaRDI portal
The following pages link to A tabu search algorithm for the quadratic assignment problem (Q1773110):
Displaying 14 items.
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- The generalised machine layout problem (Q3163382) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
