Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10852-007-9070-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006608876 / rank | |||
Normal rank | |||
Revision as of 20:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Memetic algorithms: The polynomial local search complexity theory perspective |
scientific article |
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
