In the classical 2D rectangular bin packing problem [2] we are given a set of two dimensional rectangular items and an unlimited number of identical large rectangular bins. We need to place the items into a minimal number of bins, The orientation of the items is parallel to the bounds of the bins. Overlaps of items are not allowed.
展开▼
