Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103)
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: Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem |
scientific article; zbMATH DE number 7395722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem |
scientific article; zbMATH DE number 7395722 |
Statements
Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (English)
0 references
15 September 2021
0 references
binary paint shop problem
0 references
greedy heuristic
0 references
recursive greedy heuristic
0 references
red first heuristic
0 references
greedy-perfect
0 references
recursive-greedy-perfect
0 references
red-first-perfect
0 references
APX-hardness
0 references
0 references
0.8974563
0 references
0.8643506
0 references
0.8615088
0 references
0.82247585
0 references
0.82102716
0 references
0.8190798
0 references
0.8177367
0 references
0.8112305
0 references
0.8098905
0 references
