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 present an exact method, based on an arc-flow formulation with side constraints, for
solving bin packing and cutting stock problems—including multi-constraint variants—by …

In the two‐dimensional (2D) cutting (2DC) problem, a large rectangular sheet has to be
dissected into smaller rectangular pieces with the aim of maximizing the total profit …

Приводятся примеры постановок задач раскроя-упаковки, актуальность которых
подтверждается их разнообразием и многогранностью прикладного значения …

The problem addressed in this paper is the decision problem of determining if a set of multi-
dimensional rectangular boxes can be orthogonally packed into a rectangular bin while …

The parallel processor scheduling and bin packing problems with contiguity constraints are
important in the field of combinatorial optimization because both problems can be used as …

We consider the 2D orthogonal feasibility problem (OPP-2) and the 2D strip packing
problem (SPP-2). Given a set of rectangular items, the OPP-2 is to decide whether all items …

In recent years, there has been considerable interest in the transformative potential of
additive manufacturing (AM) since it allows for producing highly customizable and complex …

Packing problems (sometimes also called cutting problems) are combinatorial optimization
problems concerned with placement of objects (items) in one or several containers. Some …

We consider the feasibility problem OPP (orthogonal packing problem) in higher-
dimensional orthogonal packing: given a set of d-dimensional (d≥ 2) rectangular items …