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 …

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

Cutting and packing (C&P) is a fundamental research area that models a large number of
managerial and industrial optimization issues. A solution to a C&P problem basically …

In this paper we describe a branch-and-cut algorithm for the vehicle routing problem with
unloading constraints. The problem is to determine a set of routes with minimum total cost …

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 …

Two-dimensional cutting and packing problems model a large number of relevant industrial
applications. The literature on practical algorithms for such problems is very large. We …

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 …

The paper studies the two-dimensional strip packing problem with defects (2DSPP_D),
focusing on packing rectangular items orthogonally within a fixed-width, variable-height strip …

We study a two-dimensional packing problem where rectangular items are placed into a
circular container to maximize either the number or the total area of items packed. We adapt …

In practice the maximum usage of container space arises in many applications which is one
of the crucial economical requirements that have a wide impact on good transportation. A …