Complexity results on a paint shop problem.
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Paintshop, odd cycles and necklace splitting
- Computing solutions of the paintshop-necklace problem
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem
- Greedy colorings for the binary paintshop problem
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
- Complexity results on restricted instances of a paint shop problem for words
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
- Greedy colorings of words
- Fair division and generalizations of Sperner- and KKM-type results
- scientific article; zbMATH DE number 6161631 (Why is no real title available?)
- MaxFlow-MinCut duality for a paint shop problem
- Complexity issues in vertex-colored graph pattern matching
- Some heuristics for the binary paint shop problem and their expected number of colour changes
- scientific article; zbMATH DE number 2230242 (Why is no real title available?)
- Improved bounds for the binary paint shop problem
- Unfairly splitting separable necklaces
This page was built for publication: Complexity results on a paint shop problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427181)