We survey the main formulations and solution methods for two-dimensional orthogonal cutting packing problems, where both items bins are rectangles. focus on exact relaxations four problems from literature: finding a with minimum height, into number of bins, maximum value, determining existence feasible packing.