Abstract.
The modified integer round-up property (MIRUP) for a linear integer minimization problem means that the optimal value of this problem is not greater than the optimal value of the corresponding LP relaxation rounded up plus one. In earlier papers the MIRUP was shown to hold for the so-called divisible case and some other subproblems of the one-dimensional cutting stock problem. In this paper we extend the results by using special transformations, proving the existence of non-elementary patterns in the solution, and using more detailed greedy techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 1996/Revised version July 1997
Rights and permissions
About this article
Cite this article
Nitsche, C., Scheithauer, G. & Terno, J. New cases of the cutting stock problem having MIRUP. Mathematical Methods of OR 48, 105–115 (1998). https://doi.org/10.1007/PL00020909
Issue Date:
DOI: https://doi.org/10.1007/PL00020909