Large gaps in one-dimensional cutting stock problems

Authors:
J. Rietz;S. Dempe
Affiliations:
Faculty of Science, Technical University Dresden, Zellescher Weg 12-14, Dresden 01062, Germany and Department of Mathematics and Computer Science, Technical University Bergakademie Freiberg, Akade ...;Department of Mathematics and Computer Science, Technical University Bergakademie Freiberg, Akademiestr. 6, Freiberg 09596, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 5
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Mathematics of Operations Research
Families of non-IRUP instances of the one-dimensional cutting stock problem

Discrete Applied Mathematics
An instance of the cutting stock problem for which the rounding property does not hold

Operations Research Letters

Conservative scales in packing problems

OR Spectrum

Quantified Score

Hi-index	0.04

Visualization

Abstract

Its linear relaxation is often solved instead of the one-dimensional cutting stock problem (1CSP). This causes a difference between the optimal objective function values of the original problem and its relaxation, called a gap. The size of this gap is considered in this paper with the aim to formulate principles for the construction of instances of the 1CSP with large gaps. These principles are complemented by examples for such instances.