| Article ID: | iaor19992376 |
| Country: | Germany |
| Volume: | 48 |
| Issue: | 1 |
| Start Page Number: | 105 |
| End Page Number: | 115 |
| Publication Date: | Jan 1998 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Scheithauer G., Terno J., Nitsche C. |
| Keywords: | programming: integer |
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.