Logic based Benders' decomposition for orthogonal stock cutting problems


We consider the problem of packing a set of rectangular items into a strip of fixed width, without overlapping, using minimum height. Items must be packed with their edges parallel to those of the strip, but rotation by 90◦ is allowed. The problem is usually solved through branch-and-bound algorithms. We propose an alternative method, based on Benders… (More)
DOI: 10.1016/j.cor.2016.09.009


8 Figures and Tables

Slides referencing similar topics