Abstract : Our problem consists in determining the number of large identical rectangles used to pack a list of rectangles with a fixed orientation. We propose methods to compute lower bounds, based on the concept of dual-feasible functions. We also propose two enumerative exact methods. One is devoted to the problem with one bin. It uses a new relaxation of the problem. The other solves the optimization problem by iteratively decomposing the set of rectangles.