Exact solution techniques for two-dimensional cutting and packing
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 …
cutting and packing problems, where both items and bins are rectangles. We focus on exact …
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
M Russo, M Boccia, A Sforza… - … in Operational Research, 2020 - Wiley Online Library
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 …
dissected into smaller rectangular pieces with the aim of maximizing the total profit …
Modeling two-dimensional guillotine cutting problems via integer programming
F Furini, E Malaguti… - INFORMS Journal on …, 2016 - pubsonline.informs.org
We propose a framework to model general guillotine restrictions in two-dimensional cutting
problems formulated as mixed-integer linear programs (MIPs). The modeling framework …
problems formulated as mixed-integer linear programs (MIPs). The modeling framework …
Exact algorithms for the two-dimensional guillotine knapsack
The two-dimensional knapsack problem requires to pack a maximum profit subset of “small”
rectangular items into a unique “large” rectangular sheet. Packing must be orthogonal …
rectangular items into a unique “large” rectangular sheet. Packing must be orthogonal …
A block-based heuristic search algorithm for the two-dimensional guillotine strip packing problem
Introduction: This paper addresses the two-dimensional strip-packing (2DSP) problem of
placing a set of rectangular pieces onto a fixed-width rectangular sheet to minimize the total …
placing a set of rectangular pieces onto a fixed-width rectangular sheet to minimize the total …
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
This paper addresses the two-dimensional bin packing problem with guillotine constraints.
The problem requires a set of rectangular items to be cut from larger rectangles, known as …
The problem requires a set of rectangular items to be cut from larger rectangles, known as …
A branch-and-price algorithm for the two-stage guillotine cutting stock problem
We investigate the two-stage guillotine two-dimensional cutting stock problem. This problem
commonly arises in the industry when small rectangular items need to be cut out of large …
commonly arises in the industry when small rectangular items need to be cut out of large …
A block-based layer building approach for the 2D guillotine strip packing problem
We examine the 2D strip packing problems with guillotine-cut constraint, where the objective
is to pack all rectangles into a strip with fixed width and minimize the total height of the strip …
is to pack all rectangles into a strip with fixed width and minimize the total height of the strip …
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
This paper studies the unconstrained two-dimensional non-guillotine cutting problem, in
which the objective is to select and pack a set of rectangles into a sheet with fixed sizes and …
which the objective is to select and pack a set of rectangles into a sheet with fixed sizes and …
LP bounds in various constraint programming approaches for orthogonal packing
M Mesyagutov, G Scheithauer, G Belov - Computers & Operations …, 2012 - Elsevier
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 …
problem (SPP-2). Given a set of rectangular items, the OPP-2 is to decide whether all items …