After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

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 bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

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 …

We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

The graphical user interface (GUI) has become the prime means for interacting with
computing systems. It leverages human perceptual and motor capabilities for elementary …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Mobile-edge cloud computing is a new paradigm to provide cloud computing capabilities at
the edge of pervasive radio access networks in close proximity to mobile users. Aiming at …

Higher-dimensional orthogonal packing problems have a wide range of practical
applications, including packing, cutting, and scheduling. Combining the use of our data …

The two-dimensional bin-packing problem is the problem of orthogonally packing a given
set of rectangles into a minimum number of two-dimensional rectangular bins. The problem …