Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962)
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 5933869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some heuristics for the binary paint shop problem and their expected number of colour changes |
scientific article; zbMATH DE number 5933869 |
Statements
Some heuristics for the binary paint shop problem and their expected number of colour changes (English)
0 references
29 July 2011
0 references
greedy algorithm
0 references
paint shop problem
0 references
average performance
0 references
0.8502514362335205
0 references
0.8177844285964966
0 references
0.7914128303527832
0 references
0.7597638368606567
0 references
0.753781259059906
0 references
