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. ...

The relationship between the distribution of particle centers in random beds of uniformly sized spheres and radial properties, in particular radial voidage profiles, is undertaken in this work. To this end, closed expressions ...

As in many other combinatorial optimisation problems, research on nesting problems (aka irregular packing problems) has evolved around the dichotomy between continuous (time consuming) and discrete (memory consuming) ...

Let p be a prime, and let zeta(p) be a primitive p-th root of unity. The lattices in Craig's family are (p - 1)-dimensional and are geometrical representations of the integral Z[zeta(p)]-ideals < 1 - zeta(p)>(i), where i ...

Na busca por novos sistemas de comunicações muitos trabalhos têm sido realizados com o objetivo de obter constelações de sinais e códigos geometricamente uniformes no espaço euclidiano. Neste contexto, nossa proposta é ...

We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects, each being a connected subgraph of G with a prescribed weight, and the ...