Pages that link to "Item:Q2488198"
From MaRDI portal
The following pages link to Compounded genetic algorithms for the quadratic assignment problem (Q2488198):
Displayed 6 items.
- 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)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Linear programming system identification: the general nonnegative parameters case (Q2456406) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)