A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
G Belov, G Scheithauer - European journal of operational research, 2006 - Elsevier
The one-dimensional cutting stock problem (1D-CSP) and the two-dimensional two-stage
guillotine constrained cutting problem (2D-2CP) are considered in this paper. The Gilmore …
guillotine constrained cutting problem (2D-2CP) are considered in this paper. The Gilmore …
Integer linear programming models for 2-staged two-dimensional knapsack problems
We are given a unique rectangular piece of stock material S, with height H and width W, and
a list of m rectangular shapes to be cut from S. Each shape's type i (i= 1,..., m) is …
a list of m rectangular shapes to be cut from S. Each shape's type i (i= 1,..., m) is …
An integer programming model for two-and three-stage two-dimensional cutting stock problems
In this paper, an integer programming model for two-dimensional cutting stock problems is
proposed. In the problems addressed, it is intended to cut a set of small rectangular items of …
proposed. In the problems addressed, it is intended to cut a set of small rectangular items of …
Modeling two-dimensional guillotine cutting problems via integer programming
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 …
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
We consider a Two-Dimensional Cutting Stock Problem (2DCSP) where stock of different
sizes is available, and a set of rectangular items has to be obtained through two-stage …
sizes is available, and a set of rectangular items has to be obtained through two-stage …
Mathematical models for a cutting problem in the glass manufacturing industry
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 …
Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
In this paper, we consider the two-dimensional Variable-Sized Cutting Stock Problem (2D-
VSCSP) with guillotine constraint, applied to the home textile industry. This is a challenging …
VSCSP) with guillotine constraint, applied to the home textile industry. This is a challenging …
Two‐stage two‐dimensional guillotine cutting stock problems with usable leftover
In this study, we solve the nonexact two‐stage two‐dimensional guillotine cutting problem
considering usable leftovers, in which stock plates remainders of the cutting patterns …
considering usable leftovers, in which stock plates remainders of the cutting patterns …
[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 …
An integrated cutting stock and sequencing problem
HH Yanasse, MJP Lamosa - European Journal of Operational Research, 2007 - Elsevier
In this paper an integrated problem formulated as an integer linear programming problem is
presented to find an optimal solution to the cutting stock problem under particular pattern …
presented to find an optimal solution to the cutting stock problem under particular pattern …