A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed ...

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, ...

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. ...

We study the two-dimensional geometricknapsack problem (2DK) in which we are given a setofnaxis-aligned rectangular items, each one with anassociated profit, and an axis-aligned square knapsack. ...

This research approaches the two-dimensional rectangular strip packing problem (2DSPP), where the main goal is to pack a determined number of rectangles, without overlap, to minimize the strip height. In the rectangular ...