A framework for analyzing sub-optimal performance of local search algorithms (Q548682)
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: A framework for analyzing sub-optimal performance of local search algorithms |
scientific article; zbMATH DE number 5915212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A framework for analyzing sub-optimal performance of local search algorithms |
scientific article; zbMATH DE number 5915212 |
Statements
A framework for analyzing sub-optimal performance of local search algorithms (English)
0 references
30 June 2011
0 references
convergence
0 references
finite-time performance
0 references
simulated annealing
0 references
tabu search
0 references
Lin-Kernighan-Helsgaun algorithm
0 references
travelling salesman problem
0 references
0 references
0.8527834415435791
0 references
0.8446998596191406
0 references
0.7767665982246399
0 references
0.7767665982246399
0 references
