This paper reviews the most relevant literature on efficient models and methods for packing
circular objects/items into Euclidean plane regions where the objects/items and regions are …

In this paper an optimized multidimensional hyperspheres packing problem (HPP) is
considered for a bounded container. Additional constraints, such as prohibited zones in the …

Abstract During the Annual Operational Research Society Simulation Workshop in
Worchester, UK, in 2010, a panel discussion entitled “discrete‐event simulation (DES) is …

In this paper we consider the problem of packing unequal circles in a fixed size circular
container, where the objective is to maximise the value of the circles packed. We consider …

In this paper we present a heuristic algorithm for the problem of packing unequal circles in a
fixed size container such as the unit circle, the unit square or a rectangle. We view the …

The paper considers a problem of packing unequal circles into a rectangular strip with fixed
width and minimal length. We develop the idea of increasing the dimension of the solution …

The packing of different circles in a circular container under balancing and distance
conditions is considered. Two problems are studied: the first minimizes the container's …

In this paper, we discuss the circular open dimension problem (CODP); that is a problem of
the cutting/packing family. In CODP, we are given an initial strip of fixed width W and …

This paper investigates the circular open dimension problem (CODP), which consists of
packing a set of circles of known radii into a strip of fixed width and unlimited length without …

This paper addresses an important extension of the circle packing problem (CPP), the circle
packing problem with equilibrium constraints (CPPEC). It considers the dense packing of n …