“…In the following decade, a survey on general two-dimensional packing problems was proposed by Alvarez-Valdes et al [1]. Surveys on specific problems, variants, and methodologies were produced by Lodi et al [30] (2D-BPP and 2D-SPP), Silva et al [44] (pallet loading problem, a variant of the 2D-BPP in which one has to pack, with orthogonal rotations, the maximum number of identical items into a single bin), Oliveira et al [40] (2D-SPP), Christensen et al [14] (approximation and online algorithms), and Russo et al [41] (upper bounds for problems with guillotine cuts).…”