Three new stochastic local search algorithms for continuous optimization problems (Q2636613)
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: Three new stochastic local search algorithms for continuous optimization problems |
scientific article; zbMATH DE number 6252371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three new stochastic local search algorithms for continuous optimization problems |
scientific article; zbMATH DE number 6252371 |
Statements
Three new stochastic local search algorithms for continuous optimization problems (English)
0 references
30 January 2014
0 references
best performance algorithm
0 references
iterative best performance algorithm
0 references
largest absolute difference algorithm
0 references
tabu search
0 references
simulated annealing
0 references
unconstrained continuous optimization problems
0 references
0 references
0.7386941313743591
0 references
0.7030161619186401
0 references
0.6921091079711914
0 references
0.6861655116081238
0 references
