Irregular packing problems (also known as nesting problems) belong to the more general
class of cutting and packing problems and consist of allocating a set of irregular and regular …

The irregular strip-packing problem, also known as nesting or marker making, is defined as
the automatic computation of a non-overlapping placement of a set of non-convex polygons …

We further improve our methodology for solving irregular packing and cutting problems. We
deal with an accurate representation of objects bounded by circular arcs and line segments …

We describe our methodology for solving NP-hard irregular placement problems. We deal
with an accurate representation of objects bounded by circular arcs and line segments and …

The paper investigates the two-dimensional irregular packing problem with multiple
homogeneous bins (2DIBPP). The literature on irregular shaped packing problems is …

Abstract We study the Nesting Problem, which aims to determine a configuration of a set of
irregular shapes within a rectangular sheet of material of fixed width, such that no overlap …

A two-dimensional cutting (packing) problem with items of irregular shape and rectangular
sheets is studied. Three types of problems are considered: single-sheet problems without …

The Nesting problem is a complex problem that arises in industries where sets of pieces or
space must be efficiently placed or allocated in order to minimize wasted space or wasted …

This paper presents an approach that assists in producing highly compacted Nesting layouts
with irregular pieces using free rotations. This approach consists in the selection and …

In this work, we present a strategy for distributing a collection of heterogeneous circles over
a convex domain such that there are no gaps between circles. We find optimal power …