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

Authors:
Odile Marcotte
Affiliations:
Département de Mathématiques et d'informatique, Université du Québec à Montréal, C.P. 8888, Succ. A, Montréal, Qué., Canada H3C 3P8
Venue:
Operations Research Letters
Year:
1986

Citing 1
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Large gaps in one-dimensional cutting stock problems

Discrete Applied Mathematics
Knowledge based approach to the cutting stock problem

Mathematical and Computer Modelling: An International Journal
Carathéodory bounds for integer cones

Operations Research Letters
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We say that an instance of the cutting stock problem has the integer rounding property if its optimal value is the least integer greater than or equal to the optimal value of its linear programming relaxation. In this note we give an instance of the cutting stock problem for which the rounding property does not hold, and show that it is NP-hard to decide whether the rounding holds or not.