Two-Dimensional Bin Packing Problems

We survey recent advances obtained for the two-dimensional bin packing problem. With regard to heuristics, we will only consider off-line algorithms, for which it is assumed that the algorithm has full knowledge of the whole input. We start by reviewing classical mathematical models which have implications relevant to the topic of the present survey, and discuss more recent results. The following sections are devoted to upper bounds, including metaheuristics and approximation algorithms, lower bounds, and exact algorithms. Some worst-case results are also discussed.