Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Thomas Stützle / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6650632 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Tabu Search | |||
Property / zbMATH Keywords: Tabu Search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Simulated Annealing | |||
Property / zbMATH Keywords: Simulated Annealing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Quadratic Assignment Problem | |||
Property / zbMATH Keywords: Quadratic Assignment Problem / rank | |||
Normal rank |
Revision as of 05:20, 28 June 2023
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