On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms

Susanne Albers, Waldo Gálvez, Ömer Behic Özdemir

We study a two-dimensional generalization of the classical Bin Packing problem, denoted as 2D Demand Bin Packing. In this context, each bin is a horizontal timeline, and rectangula…