A framework for analyzing sub-optimal performance of local search algorithms (Q548682): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / 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: 5915212 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
convergence | |||
| Property / zbMATH Keywords: convergence / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
finite-time performance | |||
| Property / zbMATH Keywords: finite-time performance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
simulated annealing | |||
| Property / zbMATH Keywords: simulated annealing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tabu search | |||
| Property / zbMATH Keywords: tabu search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Lin-Kernighan-Helsgaun algorithm | |||
| Property / zbMATH Keywords: Lin-Kernighan-Helsgaun algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
travelling salesman problem | |||
| Property / zbMATH Keywords: travelling salesman problem / rank | |||
Normal rank | |||
Revision as of 12:04, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A framework for analyzing sub-optimal performance of local search algorithms |
scientific article |
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
