Skip to main content

Cutting Problems

  • Chapter
  • 1253 Accesses

Part of the Natural Computing Series book series (NCS)

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-16544-3_13
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-16544-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Hardcover Book
USD   99.99
Price excludes VAT (USA)

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

    CrossRef  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

    CrossRef  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

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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)