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 …
Arc flow formulations based on dynamic programming: Theoretical foundations and applications
Network flow formulations are among the most successful tools to solve optimization
problems. Such formulations correspond to determining an optimal flow in a network. One …
problems. Such formulations correspond to determining an optimal flow in a network. One …
[HTML][HTML] Last fifty years of integer linear programming: a focus on recent practical advances
F Clautiaux, I Ljubić - European Journal of Operational Research, 2024 - Elsevier
Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …
This is driven by the enhanced efficiency of modern solvers, which can today find globally …
Mathematical models for a cutting problem in the glass manufacturing industry
F Parreño, R Alvarez-Valdes - Omega, 2021 - Elsevier
The glass cutting problem proposed for the ROADEF 2018 challenge is a two-dimensional,
three-stage guillotine cutting process, with an additional cut to obtain pieces in some specific …
three-stage guillotine cutting process, with an additional cut to obtain pieces in some specific …
[HTML][HTML] The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems
Cutting and packing problems are challenging combinatorial optimization problems that
have many relevant industrial applications and arise whenever a raw material has to be cut …
have many relevant industrial applications and arise whenever a raw material has to be cut …
[HTML][HTML] Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
In this work, we study the problem of scheduling jobs and maintenance activities on a set of
unrelated parallel machines, by considering that the processing time of a job increases …
unrelated parallel machines, by considering that the processing time of a job increases …
Solving a large cutting problem in the glass manufacturing industry
The glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge
includes some specific constraints that prevent the direct application of procedures …
includes some specific constraints that prevent the direct application of procedures …
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
L Libralesso, F Fontan - European journal of operational research, 2021 - Elsevier
In this article, we present the anytime tree search algorithm we designed for the 2018
ROADEF/EURO challenge glass cutting problem proposed by the French company Saint …
ROADEF/EURO challenge glass cutting problem proposed by the French company Saint …
On guillotine separable packings for the two-dimensional geometric knapsack problem
In two-dimensional geometric knapsack problem, we are given a set of n axis-aligned
rectangular items and an axis-aligned square-shaped knapsack. Each item has integral …
rectangular items and an axis-aligned square-shaped knapsack. Each item has integral …
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 …