Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877)
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 681868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulated annealing and tabu search in the long run: A comparison on QAP tasks |
scientific article; zbMATH DE number 681868 |
Statements
Simulated annealing and tabu search in the long run: A comparison on QAP tasks (English)
0 references
6 November 1994
0 references
simulated annealing
0 references
tabu search
0 references
quadratic assignment problem
0 references
0.9024454951286316
0 references
0.8899778127670288
0 references
0.8195418119430542
0 references
0.8030756115913391
0 references
