Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:37, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances |
scientific article |
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
