Abstract Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively
reduce logistics costs in various areas, such as airline cargo management and warehouse …

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 …

The three-dimensional packing problem (3D-PP) is a classic NP-hard problem in operations
research and computer science. One of the most popular ways to solve the problem is …

This paper addresses the Single Container Loading Problem. We present an exact
approach that considers the resolution of integer linear programming and constraint …

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 …

This paper aims to solve the large-scale heterogeneous container loading problem (HCLP),
which is an extensive form of the multiple container loading problem, in a limited time. The …

We address the multi container loading problem of a company that serves its customers'
orders by building pallets with the required products and loading them into trucks. The …

Despite its wide range of applications, the three-dimensional bin-packing problem is still one
of the most difficult optimization problems to solve. Currently, medium-to large-size instances …

In this paper, we address multiple container loading problems, consisting of placing
rectangular boxes, orthogonally and without overlapping, inside containers in order to …

Abstract Three-dimensional Cutting and Packing Problems consist of a set of items that must
be placed inside one or more larger items (containers). Such problems enforce non …