Pages that link to "Item:Q1427181"
From MaRDI portal
The following pages link to Complexity results on a paint shop problem. (Q1427181):
Displaying 10 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Greedy colorings of words (Q444455) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Greedy colorings for the binary paintshop problem (Q2266932) (← links)
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops (Q2307010) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
