Vadim M. Kartak

According to our database, Vadim M. Kartak authored at least 7 papers between 2009 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Large proper gaps in bin packing and dual bin packing problems.

Vadim M. Kartak, Artem V. Ripatti

J. Glob. Optim., 2019

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

Artem V. Ripatti, Vadim M. Kartak

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

An Integer Programming Approach to the Irregular Polyomino Tiling Problem.

Vadim M. Kartak, Aigul Fabarisova

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018

The minimum raster set problem and its application to the <i>d</i>-dimensional orthogonal packing problem.

Vadim M. Kartak, Artem V. Ripatti

Eur. J. Oper. Res., 2018

2015

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

2013

Conservative scales in packing problems.

Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer

OR Spectr., 2013

2009

One-dimensional relaxations and LP bounds for orthogonal packing.

Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer

Int. Trans. Oper. Res., 2009