Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2013.10.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2013.10.007 / rank | |||
Normal rank | |||
Revision as of 00:05, 9 December 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
0 references
0 references
