V. M. Kartak

Available identifiers

Publication	Date of Publication	Type
Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property	2022-07-15	Paper
Sensitive instances of the cutting stock problem	2021-02-25	Paper
Large proper gaps in bin packing and dual bin packing problems	2019-06-20	Paper
The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem	2018-07-25	Paper
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem	2015-06-10	Paper
Combinatorial complexity of a certain 1-dimensional cutting stock problem	2012-07-26	Paper
A grouping method for solving a continuous linear cutting stock problem	2012-02-20	Paper
Local search of orthogonal packings using the lower bounds	2009-11-24	Paper
Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem	2005-08-08	Paper

This page was built for person: V. M. Kartak