THE MODIFIED INTEGER ROUND-UP PROPERTY OF THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM

A linear integer minimization problem (IP) has the modified integer round-up property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stack problem. The computational experiments carried out with a lot of randomly generated instances of the one-dimensional cutting stock problem show, that for all instances an integer solution fulfills the MIRUP. Moreover, in most cases the optimal value equals the round-up optimal value of the corresponding LP relaxation. Similarly, the approach proposed to verify the MIRUP is usable as a new heuristic procedure for solving one-dimensional cutting stock problems. This heuristic always leads to very good solutions being optimal in the most cases.