We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

Over the years, methods and algorithms have been extensively studied to solve variations of
the rectangular two-dimensional strip packing problem (2D-SPP), in which small rectangles …

In recent years, deep reinforcement learning has shown great potential in solving computer
games with sequential decision-making scenarios. Hyper-heuristic is a generic search …

Cutting and packing problems have been widely studied in the last decades, mainly due to
the variety of industrial applications where the problems emerge. This paper presents an …

This paper introduces novel mathematical optimisation models for the 2-Dimensional
guillotine Cutting Stock Problem with Variable-Sized Stock that appears in a Spanish …

The rectangle packing area minimization problem (RPAMP) has a wide range of
applications in industry. The purpose of RPAMP is to ensure maximum use of the materials …

Given a fixed set of rectangular items and a single rectangular object of fixed width and
unlimited height, the two-dimensional strip packing problem consists of packing all the items …

The sheet metals can be cut into rectangular or irregular pieces, where the main objective is
to minimize the sheet metal's physical waste. However, the operating time, the number of …

Two-dimensional cutting and packing problems model a large number of relevant industrial
applications. The literature on practical algorithms for such problems is very large. We …

Tackling uncertainty is becoming increasingly relevant for decision-support across fields due
to its critical impact on real-world problems. Uncertainty is often modelled using scenarios …