Asli GulerUrfat NuriyevGuler, AsliNuriyev, Urfat2025-10-0620139783319604855, 9783319276427, 9783319419343, 9783319232034, 9783319938844, 9783642330414, 9783319262833, 9788132220084, 9783642375019, 9783030026820978331900950621945357, 219453652194-535710.1007/978-3-319-00951-3_82-s2.0-84882954653https://www.scopus.com/inward/record.uri?eid=2-s2.0-84882954653&doi=10.1007%2F978-3-319-00951-3_8&partnerID=40&md5=21567b67ff55036dfb2d3e4abbd75010https://gcris.yasar.edu.tr/handle/123456789/10137https://doi.org/10.1007/978-3-319-00951-3_8In this study Change Making Problem (CMP) and Subset-Sum Problem (SSP) which can arise in practice in some classes of one dimensional cargo loading and cutting stock problems are researched. These problems are often used in computer science as well. CMP and SSP are NP-hard problems and these problems can be seen as types of the knapsack problem in some ways. The complementary problems for the change making problem and the subsetsum problem are defined in this study and it is aimed to examine the CMP and SSP by means of the complementary problems. © 2015 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessChange Making Problem, Complementary Problem, Greedy Algorithm, Subset-sum Problem, Computational Complexity, Information Technology, Integer Programming, Change Making Problem, Complementary Problems, Cutting Stock Problem, Greedy Algorithms, Knapsack Problems, Subset Sum, Subset-sum Problem, LoadingComputational complexity, Information technology, Integer programming, change making problem, Complementary problems, Cutting stock problem, Greedy algorithms, Knapsack problems, Subset sum, Subset-sum problem, LoadingSubset-Sum ProblemChange Making ProblemGreedy AlgorithmComplementary ProblemConference Object