Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances |
scientific article; zbMATH DE number 6650632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances |
scientific article; zbMATH DE number 6650632 |
Statements
Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (English)
0 references
10 November 2016
0 references
Tabu Search
0 references
Simulated Annealing
0 references
Quadratic Assignment Problem
0 references
0 references
0 references
0.90817528963089
0 references
0.8899778127670288
0 references
0.827666163444519
0 references
0.8011415004730225
0 references
