Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. - Vadim M. Kartak; Artem V. Ripatti; Guntram Scheithauer; Sascha Kurz (Discret. Appl. Math., 2015)

The minimum raster set problem and its application to the d-dimensional orthogonal packing problem. - Vadim M. Kartak; Artem V. Ripatti (Eur. J. Oper. Res., 2018)

Bounds for Non-IRUP Instances of Cutting Stock Problem with Minimal Capacity. - Artem V. Ripatti; Vadim M. Kartak (MOTOR (2), 2019)

Large proper gaps in bin packing and dual bin packing problems. - Vadim M. Kartak; Artem V. Ripatti (J. Glob. Optim., 2019)