A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM (Q5483436)
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: A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM |
scientific article; zbMATH DE number 5045369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM |
scientific article; zbMATH DE number 5045369 |
Statements
A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM (English)
0 references
14 August 2006
0 references
combinatorial optimization
0 references
greedy heuristic
0 references
minimum weight vertex cover
0 references
steady-state genetic algorithm
0 references
0.8722646236419678
0 references
0.8350679874420166
0 references
0.824199378490448
0 references
