Models for the two-dimensional two-stage cutting stock problem with multiple stock size

Authors:
Fabio Furini;Enrico Malaguti
Affiliations:
Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS, (UMR 7538), F-93430, Villetaneuse, France;DEI, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

Management Science
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
Arc-flow model for the two-dimensional guillotine cutting stock problem

Computers and Operations Research
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 guillotine cuts. We propose and computationally compare three Mixed-Integer Programming models for the 2DCSP developing formulations from the literature. The first two models have a polynomial and pseudo-polynomial number of variables, respectively, and can be solved with a general-purpose MIP solver. The third model, having an exponential number of variables, is solved via branch-and-price techniques. We conclude the paper describing the results of extensive computational experiments on a set of benchmark instances from the literature.