A New Graph-Theoretical Model for the Guillotine-Cutting Problem

@article{Clautiaux2013ANG,
  title={A New Graph-Theoretical Model for the Guillotine-Cutting Problem},
  author={François Clautiaux and Antoine Jouglet and Aziz Moukrim},
  journal={INFORMS Journal on Computing},
  year={2013},
  volume={25},
  pages={72-86}
}
We consider the problem of determining whether a given set of rectangular items can be cut from a larger rectangle using so-called guillotine cuts only. We introduce a new class of arc-colored directed graphs called guillotine graphs and show that each guillotine graph can be associated with a specific class of pattern solutions that we term a guillotine-cutting class. The properties of guillotine graphs are examined and some effective algorithms for dealing with guillotine graphs are proposed… CONTINUE READING