Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145)
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: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms |
scientific article; zbMATH DE number 6113934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms |
scientific article; zbMATH DE number 6113934 |
Statements
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (English)
0 references
7 December 2012
0 references
GRASP
0 references
metaheuristics
0 references
stochastic local search
0 references
run time distributions
0 references
time-to-target plots
0 references
path-relinking
0 references
0 references
0 references
0 references
0 references
0 references
0 references
