Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940)
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 6591093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybridizations of GRASP with path relinking for the far from most string problem |
scientific article; zbMATH DE number 6591093 |
Statements
Hybridizations of GRASP with path relinking for the far from most string problem (English)
0 references
9 June 2016
0 references
string problems
0 references
consensus problems
0 references
combinatorial optimization
0 references
hybrid metaheuristics
0 references
0 references
0 references
0.8118098378181458
0 references
0.7771879434585571
0 references
0.7368518710136414
0 references
0.7177566289901733
0 references
