Skip to main content
SpringerLink
Log in

MaxFlow-MinCut Duality for a Paint Shop Problem

  • Conference paper
Operations Research Proceedings 2002

Part of the book series: Operations Research Proceedings 2002 ((ORP,volume 2002))

  • 438 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Epping Th., Hochstattler W. (2002) Storage and Retrieval of Car Bodies by the Use of Line Storage Systems. Technical report btu-lsgdi-001.02, BTU Cottbus, Germany

    Google Scholar 

  2. Epping Th., Hochstattler W., Oertel P. (2002) Complexity Results on a Paint Shop Problem. Submitted to: Discrete Applied Mathematics

    Google Scholar 

  3. Golumbic, M. C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press

    Google Scholar 

  4. Seymour P. D. (1977) The Matroids with the Max-Flow Min-Cut Property. Journal of Combinatorial Theory, Series B 23, pp 189–222

    Article  Google Scholar 

  5. Spieckermann S., Vo13 S. (1996) Paint Shop Simulation in the Automotive Industry. ASIM Mitteilungen 54, pp. 367–380

    Google Scholar 

  6. Oxley,J.G.(1992)Matroid Theory.Oxford University Press

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, BTU Cottbus, 03013, Cottbus, Germany

    Thomas Epping & Winfried Hochstättler

  2. Department of Mathematical Optimization, TU Braunschweig, Germany

    Marco E. Lübbecke

Authors
  1. Thomas Epping
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Winfried Hochstättler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marco E. Lübbecke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15/E3, 8010, Graz, Austria

    Ulrike Leopold-Wildburger

  2. Institut für Mathematik, Universität Klagenfurt, 9020, Klagenfurt, Austria

    Franz Rendl

  3. Fakultät für Wirtschaftswissenschaften BWL VIII: Management Science, Otto-von-Guericke-Universität Magdeburg, 39016, Postfach 4120, Magdeburg, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epping, T., Hochstättler, W., Lübbecke, M.E. (2003). MaxFlow-MinCut Duality for a Paint Shop Problem. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55537-4_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00387-8

  • Online ISBN: 978-3-642-55537-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation