Showing 1 - 10 of 1,243
Persistent link: https://www.econbiz.de/10011656584
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/10010425001
Persistent link: https://www.econbiz.de/10012177793
Persistent link: https://www.econbiz.de/10014328032
Persistent link: https://www.econbiz.de/10000781861
Persistent link: https://www.econbiz.de/10000794555
Persistent link: https://www.econbiz.de/10003924333
Persistent link: https://www.econbiz.de/10008655097
Persistent link: https://www.econbiz.de/10008655158