Complexity results on a paint shop problem

Citations of this article
Mendeley users who have this article in their library.


Motivated by an application in the automobile industry, we present results and conjectures on a new combinatorial problem: Given a word w and restricted reservoirs of colored letters, synthesize w with a minimal number of color changes. We present a dynamic program that solves this problem and runs in polynomial time if we bound both, the number of different letters and colors. Otherwise, the problem is shown to be NP-complete. Additionally, we focus on upper bounds on the minimal number of color changes, simultaneously giving results for special instances, and posing open questions. © 2003 Elsevier B.V. All rights reserved.




Epping, T., Hochstättler, W., & Oertel, P. (2004). Complexity results on a paint shop problem. In Discrete Applied Mathematics (Vol. 136, pp. 217–226).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free