An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5842993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems |
scientific article; zbMATH DE number 5842993 |
Statements
An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (English)
0 references
31 January 2011
0 references
combinatorial optimization
0 references
computing science
0 references
tabu search
0 references
0 references
0 references
0.8244972229003906
0 references
0.8237478733062744
0 references
0.8232012987136841
0 references
0.7966458797454834
0 references
0.7952073812484741
0 references
