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

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

0.00 Avg rating0 Votes
Article ID: iaor19982427
Country: Netherlands
Volume: 20
Issue: 2
Start Page Number: 93
End Page Number: 100
Publication Date: Feb 1997
Journal: Operations Research Letters
Authors: ,
Keywords: cutting stock
Abstract:

Many numerical computations show a small difference only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.

Reviews

Required fields are marked *. Your email address will not be published.