The minimum raster set problem and its application to the d-dimensional orthogonal packing problem

We also consider the so-called raster model for OPP-d introduced by Belov, Kartak, Rohling and Scheithauer. It is a 0/1 ILP model in which the number of variables and constraints depends on the total number of raster points over all dimensions. Using our algorithm, we construct equivalent instances with a reduced number of raster points. We also present an algorithm to find a lower bound on the minimum possible number of raster points over all equivalent instances. Numerical results are presented.