Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (Q884444)
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: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem |
scientific article; zbMATH DE number 5161872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized local search, evolutionary algorithms, and the minimum spanning tree problem |
scientific article; zbMATH DE number 5161872 |
Statements
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (English)
0 references
6 June 2007
0 references
minimum spanning trees
0 references
analysis of expected optimization time
0 references
parallel random search
0 references
\((1+\lambda)\) EA
0 references
0.9006301
0 references
0.89561886
0 references
0.8941419
0 references
0 references
