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 …

Two-dimensional (2D) irregular packing problems are widespread in manufacturing
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …

Packing equal circles in a circle is a classic global optimization problem that has a rich
research history and a number of relevant applications. The problem is computationally …

Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …

Two-dimensional irregular strip packing problems are cutting and packing problems where
small pieces have to be cut from a larger object, involving a non-trivial handling of geometry …

Research on the three-dimensional (3D) packing problem has largely focused on packing
boxes for the transportation of goods. As a result, there has been little focus on packing …

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 …

The distribution of passenger vehicles is a complex task and a high cost factor for
automotive original equipment manufacturers (OEMs). On the way from the production plant …

We consider two NP-hard open dimension nesting problems for which a set of items has to
be packed without overlapping into a two-dimensional bin in order to minimize one or both …

This work presents a tailored branch‐and‐cut algorithm for the two‐dimensional irregular
strip packing problem with uncertain demand for the items to be cut. A two‐stage stochastic …