Algorithms for two-dimensional guillotine packing problems

The Guillotine Two-Dimensional Packing Problems are a class of optimization problems that require to pack rectangular items into rectangular containers with the constraint that every packed item should be possibly retrieved with a series of vertical and horizontal cuts that divide the container into 2 parts without cutting items. 2 exact and 2 heuristic algorithms have been developed, to solve respectively the Guillotine Two-Dimensional Knapsack and the Guillotine Two-Dimensional Bin Packing