Berberler M.E.Nuriyev U.G.2019-10-262019-10-2620101683-35111683-3511https://hdl.handle.net/11454/19728This paper describes an attempt to solve the one-dimensional cutting stock problem heuristically by using dynamic programming used to solve subset-sum problem which is considered as a sub-problem. Thisway an optimal solution is found for the sub-problem, which yields solution for the original problem. Thus an economical gain is achieved by decreasing the rate of trim loss. Moreover the cutting-cost can be reduced by minimizing the number of different cutting-patterns by this algorithm. Toward this goal, a new mathematical model is proposed and a novel algorithm is developed. The proposed algorithm is coded with Delphi and then through computational experiments on real-life constrainted optimization problems, the results are compared with the others in the literature. The computational experiments show the efficiency of the algorithm.eninfo:eu-repo/semantics/closedAccessBin packing problemCutting stock problemDynamic programmingHeuristic algorithmSubset-sum problemArticle911930Q1