The classical bin packing problem can be stated as follows: We are given a multiset of items {a₁, ..., a_n} with sizes in [0,1], and want to pack them into a minimum number of bins, each of which with ......

Axis-aligned rectangle packings can be characterized by the set of spatial relations that hold for pairs of rectangles (west, south, east, north). A representation of a packing consists of one satisfied spatial relation ...