2003 | OriginalPaper | Chapter
MaxFlow-MinCut Duality for a Paint Shop Problem
Authors : Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke
Published in: Operations Research Proceedings 2002
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Motivated by an application in car manufacturing we consider the following problem: How can we synthesize a given word from restricted reservoirs of colored letters with a minimal number of color changes between adjacent letters? We focus on instances in which each letter occurs exactly twice, once in each of two given colors. In this case the problem turns out to be the dual of a MinCut problem for one point extensions of a certain class of regular matroids. We discuss consequences of the MaxFlow-MinCut duality and describe algorithmic approaches.