Using Markov chains to analyze the effectiveness of local search algorithms (Q429676)
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: Using Markov chains to analyze the effectiveness of local search algorithms |
scientific article; zbMATH DE number 6048247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Markov chains to analyze the effectiveness of local search algorithms |
scientific article; zbMATH DE number 6048247 |
Statements
Using Markov chains to analyze the effectiveness of local search algorithms (English)
0 references
20 June 2012
0 references
discrete optimization
0 references
heuristics
0 references
local search
0 references
Markov chain analysis
0 references
Lin-Kernighan-Helsgaun algorithm
0 references
travelling salesman problem
0 references
state reduction
0 references
aggregation
0 references
lumping
0 references
0 references
0 references
0.8527834415435791
0 references
0.8414843678474426
0 references
0.7870171070098877
0 references
