Publications in Math-Net.Ru
-
Solving multi-objective rational placement of load-bearing walls problem via genetic algorithm
Informatics and Automation, 24:2 (2025), 464–491
-
Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
Diskretn. Anal. Issled. Oper., 27:1 (2020), 127–140
-
Combinatorial complexity of a certain 1-dimensional Cutting Stock Problem
Ufimsk. Mat. Zh., 3:4 (2011), 57–63
-
Local search of orthogonal packings using the lower bounds
Avtomat. i Telemekh., 2009, no. 6, 153–166
-
The grouping method for the linear relaxation of 1d cutting stock problem
Diskretn. Anal. Issled. Oper., 16:3 (2009), 47–62
-
Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
Avtomat. i Telemekh., 2004, no. 3, 55–61
© , 2026