Cutting and packing problems involving irregular shapes is an important problem variant
with a wide variety of industrial applications. Despite its relevance to industry, research …

The manufacturer's pallet loading problem (MPLP) has been widely studied during the past
50 years. It consists of placing a maximum number of identical rectangular boxes onto a …

Abstracts Pallets are currently the most widespread system for internal material handling
and logistics of goods through a supply chain: they represent a critical asset for all firms …

While mathematically sophisticated methods can be used to better understand and improve
processes, the nonlinear nature of food processing models can make their dynamic …

This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading
Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All …

In this work, we deal with the problem of packing (orthogonally and without overlap**)
identical rectangles in a rectangle. This problem appears in different logistics settings, such …

The three-dimensional open dimension rectangular packing problem (3D-ODRPP) aims to
pack a set of given rectangular boxes into a large rectangular container of minimal volume …

This paper presents an approach using a recursive algorithm for packing (ℓ, w)-rectangles
into larger rectangular and L-shaped pieces. Such a problem has actual applications for non …

We propose a branch-and-cut algorithm for the pallet loading problem. The 0–1 formulation
proposed by Beasley for cutting problems is adapted to the problem, adding new constraints …

This paper addresses the single and multiple container loading problems, which forms the
core engine of a warehouse management system we are contracted to implement for a …