A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933)
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 multi-start iterated greedy algorithm for the minimum weight vertex cover Pā problem |
scientific article; zbMATH DE number 7136890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem |
scientific article; zbMATH DE number 7136890 |
Statements
A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (English)
0 references
26 November 2019
0 references
iterated greedy algorithm
0 references
minimum weight vertex cover \(P_3\) problem
0 references
heuristic algorithms
0 references
combinatorial optimization problems
0 references
0 references
0 references
0.8433706164360046
0 references
0.8432590365409851
0 references
0.8411064743995667
0 references
0.8381052613258362
0 references
0.8225758671760559
0 references
