Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5262304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Memetic algorithms: The polynomial local search complexity theory perspective |
scientific article; zbMATH DE number 5262304 |
Statements
Memetic algorithms: The polynomial local search complexity theory perspective (English)
0 references
11 April 2008
0 references
Memetic algorithms
0 references
Genetic local search hybrids
0 references
Evolutionary hybrid algorithms
0 references
Travelling salesman problem
0 references
Graph partitioning
0 references
Polynomial local search
0 references
Multimeme algorithms
0 references
Meta-Lamarckian algorithms
0 references
Hyper-heuristics
0 references
0 references
0 references
0 references
0.803316056728363
0 references
0.7997784614562988
0 references
0.7701504826545715
0 references
