Two-dimensional packing problems: A survey

By Andrea Lodi, Silvano Martello, Michele Monaci. European Journal of Operational Research, 2002

874 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal Rectangle Packing: An Absolute Placement Approach (2014, background): “However, for more comprehensive overviews, we refer the reader to the numerous surveys available (Lodi, Martello, & Vigo, 2002; Lodi, Martello, & Monaci, 2002; Dowsland & Dowsland, 1992; Sweeney & Paternoster, 1992).”
Gradients are Not All You Need (2021, methodology): “In particular, we consider a variant of the widely studied “packing problem” [Lodi et al., 2002] in which disks are randomly packed into a box in two-dimension [O’Hern et al., 2003].”
The load planning problem for double-stack intermodal trains (2017, background): “For example, in two- (Lodi et al., 2002) and three-dimensional packing (Crainic et al.”
An improved typology of cutting and packing problems (2007, background): “Not only in our understanding (also see Lodi et al., 2002a; Miyazawa and Wakabayashi, 2003; Faroe et al., 2003) it would have been more obvious to reserve this name for the natural extension of the Classic (One-Dimensional) Bin Packing Problem, i.e. the packing of a set of small items of different…”
Bin packing and cutting stock problems: Mathematical models and exact algorithms (2016, background): “More recently, surveys on two-dimensional packing problems have been presented by Lodi, Martello, Monaci, and Vigo [94, 96, 95].”