A novel sphere packing problem is introduced. A maximum number of spheres of different radii should be placed such that the spheres do not overlap and their centers fulfill a quasi-containment condition. The latter allows the spheres to lie partially outside the given cuboidal container....

The rectangle packing area minimization problem is a key sub-problem of floorplanning in VLSI design. This problem places a set of axis aligned two-dimensional rectangular items of given sizes onto a rectangular plane such that no two items overlap and the area of the enveloping rectangle is...

In the rectangle packing area minimization problem (RPAMP) we are given a set of rectangles with known dimensions. We have to determine an arrangement of all rectangles, without overlapping, inside an enveloping rectangle of minimum area. The paper presents a generic approach for solving the...