Optimal Guillotine Cutting

Guntram Scheithauer
Additional contact information
Guntram Scheithauer: TU Dresden

Chapter Chapter 6 in Introduction to Cutting and Packing Optimization, 2018, pp 157-181 from Springer

Abstract: Abstract Within this chapter we address those two- and higher-dimensional cutting and packing problems where the guillotine cutting condition has to be regarded. That means, given a pattern then the desired products can be obtained by a sequence of guillotine cuts. We will consider knapsack-type problems as well as cutting stock problems.

Keywords: Guillotine Cuts; Cutting Stock Problem; Knapsack Problem; Guillotine Patterns; Longest Path Method (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-64403-5_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319644035

DOI: 10.1007/978-3-319-64403-5_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().