Aryanezhad, Mir-Bahador; Hashemi, Nima Fakhim; Makui, Ahmad - In: Journal of Industrial Engineering International 8 (2012), pp. 1-10
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...
