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

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

Mathematics Subject Classification ID

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

Cited In (4)

• Paintshop, odd cycles and necklace splitting
• Complexity results on a paint shop problem.
• Title not available (Why is that?)
• Complexity results on restricted instances of a paint shop problem for words

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)