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 …

We study the strip packing problem, in which a set of two-dimensional rectangular items has
to be packed in a rectangular strip of fixed width and infinite height, with the aim of …

We consider the problem of packing a set of rectangular items into a strip of fixed width,
without overlapping, using minimum height. Items must be packed with their edges parallel …

Port terminals processing large cargo vessels play an important role in bulk material supply
chains. This paper addresses the question of how to allocate vessels to a location on a berth …

This paper describes an exact algorithm for solving a two-dimensional orthogonal packing
problem with unloading constraints, which occurs as a subproblem of mixed vehicle routing …

The sheet metals can be cut into rectangular or irregular pieces, where the main objective is
to minimize the sheet metal's physical waste. However, the operating time, the number of …

Abstract Location-routing, inventory-routing, multi-echelon routing, routing problems with
loading constraints are classes of problems that are receiving increasing attention in the …

Packing and cutting problems have been considered a subdiscipline of operation research
for more than half a century. These problems can arise in numerous settings, including pallet …

Abstract In the oriented Two-Dimensional Strip Packing Problem (2SP), one has to pack a
set of rectangular items into a rectangular strip and minimizes the overall strip height used to …

Different grids of points to solve cutting and packing problems with rectangular shaped items
are discussed in this work. The grids are the canonical dissections (also known as normal …