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 …

Recent advances on two-dimensional bin packing problems - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

The fast-growing Internet results in massive amounts of text data. Due to the large volume of
the unstructured format of text data, extracting relevant information and its analysis becomes …

This article proposes a novel metaheuristic algorithm called Volleyball Premier League
(VPL) inspired by the competition and interaction among volleyball teams during a season. It …

We consider problems requiring to allocate a set of rectangular items to larger rectangular
standardized units by minimizing the waste. In two-dimensional bin packing problems these …

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

This article considers a combination of capacitated vehicle routing and three-dimensional
loading, with additional constraints frequently encountered in freight transportation. It …

One of the main issues in addressing three-dimensional packing problems is finding an
efficient and accurate definition of the points at which to place the items inside the bins …

We consider the problem of orthogonally packing a given set of rectangular items into a
given strip, by minimizing the overall height of the packing. The problem is NP-hard in the …

Distributors are faced with loading constraints in their route planning, eg, multi-dimensional
packing constraints, unloading sequence constraints, stability constraints and axle weight …