Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm

In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object’s walls and generate two cuboid sub-blocks, and there is … Read more