Showing 1 - 3 of 3
Persistent link: https://www.econbiz.de/10010187908
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...
Persistent link: https://www.econbiz.de/10009758832
Persistent link: https://www.econbiz.de/10011483296