Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PERL / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GRASP_QAP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-011-9769-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092220612 / rank | |||
Normal rank | |||
Revision as of 22:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms |
scientific article |
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
