Pages that link to "Item:Q1336877"
From MaRDI portal
The following pages link to Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877):
Displaying 13 items.
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Local search with memory: Benchmarking RTS (Q1908991) (← links)
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization (Q1919839) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- A multiperiod set covering location model for dynamic redeployment of ambulances (Q2456639) (← links)