An exact strip packing algorithm based on canonical forms

Our computational experiments on benchmark instances indicate that the proposed algorithm is competitive with the other algorithms. Our algorithm succeeded to find the optimal values for most of the instances in a practical time. Especially, it determined that the optimal values of instances “gcut02” and “cgcut02” (without rotations) are 1187 and 64, respectively, which have not been obtained by any of the other existing algorithms.