Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808)
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: Analyzing the complexity of finding good neighborhood functions for local search algorithms |
scientific article; zbMATH DE number 5081906
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analyzing the complexity of finding good neighborhood functions for local search algorithms |
scientific article; zbMATH DE number 5081906 |
Statements
Analyzing the complexity of finding good neighborhood functions for local search algorithms (English)
0 references
5 January 2007
0 references
Computational complexity
0 references
Local search algorithms
0 references
NP-hard discrete optimization problems
0 references
0 references
0.9042226
0 references
0.8947475
0 references
0.88535744
0 references
0.88351357
0 references
0.87994444
0 references
0.87948596
0 references
