Metropolis versus simulated annealing and the black-box-complexity of optimization problems (Q3535299)
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: Metropolis versus simulated annealing and the black-box-complexity of optimization problems |
scientific article; zbMATH DE number 5364211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Metropolis versus simulated annealing and the black-box-complexity of optimization problems |
scientific article; zbMATH DE number 5364211 |
Statements
10 November 2008
0 references
randomized search heuristics
0 references
minimum spanning tree
0 references
black-box-complexity
0 references
0.8290281295776367
0 references
0.8253726363182068
0 references
0.798840343952179
0 references
0.791602373123169
0 references
