Skip to main content
SpringerLink
Log in

Cutting Problems

  • Chapter
Bioinspired Computation in Combinatorial Optimization

Part of the book series: Natural Computing Series ((NCS))

  • 1349 Accesses

Abstract

In this chapter, we consider another important class of problems belonging to the field of combinatorial optimization. We study cutting problems in a given weighted graph. The minimum s-t cut problem is one of the basic, classical problems in combinatorial optimization, operations research, and computer science (Cormen et al., 2001). Evolutionary algorithms have produced good results for various kinds of difficult cutting problems (Duarte, Sánchez, Fernández, and Cabido, 2005; Liang, Yao, Newton, and Hoffman, 2002; Puchinger, Raidl, and Koller, 2004).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to Algorithms. McGraw-Hill, 2nd edition

    MATH  Google Scholar 

  • Duarte A, Sánchez Á, Fernández F, Cabido R (2005) A low-level hybridization between memetic algorithm and VNS for the max-cut problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’05), ACM Press, 999–1006

    Chapter  Google Scholar 

  • Liang K H, Yao X, Newton C S, Hoffman D (2002) A new evolutionary approach to cutting stock problems with and without contiguity. Computers and Operations Research 29(12):1641–1659

    Article  MathSciNet  Google Scholar 

  • Puchinger J, Raidl G R, Koller G (2004) Solving a real-world glass cutting problem. In: Proceedings of the 4th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP ’04), volume 3004 of Lecture Notes in Computer Science, Springer, 165–176

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Algorithms and Complexity, Max Planck Institute for Informatics, Campus E14, 66123, Saarbrücken, Germany

    Dr. Frank Neumann

  2. Dept. of Informatics and Mathematical Modelling, Technical University of Denmark, Richard Petersens Plads, 2800, Kgs. Lyngby, Denmark

    Dr. Carsten Witt

Authors
  1. Dr. Frank Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. Carsten Witt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carsten Witt .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, F., Witt, C. (2010). Cutting Problems. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16544-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16543-6

  • Online ISBN: 978-3-642-16544-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation