Vadim M. Kartak

Conservative scales in packing problems

Gleb Belov, Guntram Scheithauer, Heide Rohling, 2013, OR Spectr..

An Integer Programming Approach to the Irregular Polyomino Tiling Problem

Vadim M. Kartak, Aigul Fabarisova, 2019, MOTOR.

Bounds for Non-IRUP Instances of Cutting Stock Problem with Minimal Capacity

Vadim M. Kartak, Artem V. Ripatti, 2019, MOTOR.

Large proper gaps in bin packing and dual bin packing problems

Vadim M. Kartak, Artem V. Ripatti, 2019, J. Glob. Optim..

Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem

Sascha Kurz, Guntram Scheithauer, Vadim M. Kartak, 2014, Discret. Appl. Math..

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

Vadim M. Kartak, Artem V. Ripatti, 2018, Eur. J. Oper. Res..

One-dimensional relaxations and LP bounds for orthogonal packing

Gleb Belov, Guntram Scheithauer, Heide Rohling, 2009, Int. Trans. Oper. Res..

Solving Irregular Polyomino Tiling Problem Using Simulated Annealing and Integer Programming

Vadim M. Kartak, Aigul I. Fabarisova, V. Kartak, 2021, Communications in Computer and Information Science.