Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (Q1319482)
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: Best-so-far vs. where-you-are: Implications for optimal finite-time annealing |
scientific article; zbMATH DE number 550116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best-so-far vs. where-you-are: Implications for optimal finite-time annealing |
scientific article; zbMATH DE number 550116 |
Statements
Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (English)
0 references
19 April 1994
0 references
traveling salesman
0 references
graph bisection
0 references
simulated annealing
0 references
heuristic global optimization
0 references
monotone cooling schedules
0 references
hill-climbing
0 references
0 references
0 references
0.8618593811988831
0 references
0.8358238339424133
0 references
0.8313971161842346
0 references
0.8296910524368286
0 references
0.8278390765190125
0 references
