|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
A. V. Ripatti, V. M. Kartak, “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  ; J. Appl. Industr. Math., 14:1 (2020), 196–204  |
2
|
|
2011 |
| 2. |
V. M. Kartak, V. V. Kartak, “Combinatorial complexity of a certain 1-dimensional Cutting Stock Problem”, Ufimsk. Mat. Zh., 3:4 (2011), 57–63  |
|
2009 |
| 3. |
V. M. Kartak, M. A. Mesyagutov, E. A. Mukhacheva, A. S. Filippova, “Local search of orthogonal packings using the lower bounds”, Avtomat. i Telemekh., 2009, no. 6, 153–166  ; Autom. Remote Control, 70:6 (2009), 1054–1066  |
8
|
| 4. |
V. M. Kartak, “The grouping method for the linear relaxation of 1d cutting stock problem”, Diskretn. Anal. Issled. Oper., 16:3 (2009), 47–62 |
|
2004 |
| 5. |
V. M. Kartak, “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 ; Autom. Remote Control, 65:3 (2004), 407–412 |
5
|
|
| Organisations |
|
| |
|
|
Contact us: