MaxFlow-MinCut duality for a paint shop problem

zbMATH Open1162.90421MaRDI QIDQ5301765FDOQ5301765

Authors Th. Epping, Winfried. Hochstättler, Marco E. Lübbecke

Publication date 20 January 2009

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Production models (90B30)

Recommendations

• Complexity results on a paint shop problem.
• Paintshop, odd cycles and necklace splitting
• Complexity results on restricted instances of a paint shop problem for words
• Greedy colorings for the binary paintshop problem
• Computing solutions of the paintshop-necklace problem

Cited in

(4)

• Complexity results on a paint shop problem.
• Complexity results on restricted instances of a paint shop problem for words
• Paintshop, odd cycles and necklace splitting
• scientific article; zbMATH DE number 2230242 (Why is no real title available?)

This page was built for publication: MaxFlow-MinCut duality for a paint shop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301765)