Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsackproblem (2D-KP) consists of orthogonally packing a subset of the pieces within the container suchthat the sum of the values of the packed pieces is maximized. If the value of a piece is given by itsarea...