Rui LIU, Xuan YAN, Dao-yun XU, Yao-dong CUI, “Efficient heuristic algorithm for one-dimensional cutting stock problem”, Journal of Computer Applications, 29, no. 4, 2009, 1180
G G Zabudsky, N S Veremchuk, “About One–Dimensional Space Allocation Problem with forbidden zones”, J. Phys.: Conf. Ser., 1260, no. 8, 2019, 082006
Gleb Belov, Guntram Scheithauer, “Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting”, INFORMS Journal on Computing, 19, no. 1, 2007, 27
E. A. Mukhacheva, A. S. Mukhacheva, “L. V. Kantorovich and Cutting-Packing Problems: New Approaches to Combinatorial Problems of Linear Cutting and Rectangular Packing”, J Math Sci, 133, no. 4, 2006, 1504
Gennady G. Zabudsky, Natalia S. Veremchuk, 1090, Mathematical Optimization Theory and Operations Research, 2019, 131
V. Beraudo, H. Alfonso, G. Minetti, C. Salto, XXIV International Conference of the Chilean Computer Science Society, 2004, 84
V. M. Kartak, M. A. Mesyagutov, E. A. Mukhacheva, A. S. Filippova, “Local search of orthogonal packings using the lower bounds”, Autom Remote Control, 70, no. 6, 2009, 1054
Zhongxia Gong, Bailin Wang, Wenxin Zhang, Tieke Li, Yang Wang, 2021 14th International Symposium on Computational Intelligence and Design (ISCID), 2021, 152
David Pisinger, Mikkel Sigurd, “The two-dimensional bin packing problem with variable bin sizes and costs”, Discrete Optimization, 2, no. 2, 2005, 154
M.A. Verkhoturov, O.Y. Sergeyeva, “[NO TITLE AVAILABLE]”, Pesqui. Oper., 20, no. 2, 2000, 233