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 …

The number of publications in the area of Cutting and Packing (C&P) has increased
considerably over the last two decades. The typology of C&P problems introduced by …

The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

A (general) circle packing is an optimized arrangement of N arbitrary sized circles inside a
container (eg, a rectangle or a circle) such that no two circles overlap. In this paper, we …

We present an algorithm for generating volume elements of short fiber reinforced plastic
microstructures for prescribed fourth order fiber orientation tensor, fiber aspect ratio and …

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented
Lagrangian are useful tools for solving nonlinear programming problems. Their reputation …

Given a fixed set of identical or different-sized circular items, the problem we deal with
consists on finding the smallest object within which the items can be packed. Circular …

We address a new packing problem variant known as the 2D circle bin packing problem (2D-
CBPP), which involves packing circles into multiple square bins as densely as possible so …

In this chapter we further develop the main tool of our studies, phi-functions. We define new
functions, called quasi-phi-functions, that we use for analytic description of relations of …

This paper addresses a special case of irregular bin packing problem which the irregular
pieces with free rotation have to fill a large irregular stock sheet with defective regions while …