2 papers
math.OC2025
A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations
Juan J. Lastra-Díaz, M. Teresa Ortuño
The irregular strip-packing problem consists of the computation of a non-overlapping placement of a set of polygons onto a rectangular strip of fixed width and the minimal length p…
math.OC2022
A new mixed-integer programming model for irregular strip packing based on vertical slices with a reproducible survey
Juan J. Lastra-Díaz, M. Teresa Ortuño
The irregular strip-packing problem, also known as nesting or marker making, is defined as the automatic computation of a non-overlapping placement of a set of non-convex polygons…