Pages that link to "Item:Q621965"
From MaRDI portal
The following pages link to An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965):
Displaying 3 items.
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
