Asli GulerUrfat NuriyevMurat Erşen BerberlerFidan NuriyevaBerberler, Murat ErsenNuriyev, Urfat G.Guler, AsliNuriyeva, Fidan2025-10-06201210294945, 023319340233-19341029-494510.1080/02331934.2011.6178182-s2.0-84859576205https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859576205&doi=10.1080%2F02331934.2011.617818&partnerID=40&md5=63e87b829c475758554150f43e5d7fb1https://gcris.yasar.edu.tr/handle/123456789/10188https://doi.org/10.1080/02331934.2011.617818In this study one-dimensional knapsack problems (KP) which have many applications in technical and economic areas are studied, then greedy algorithms are discussed for these problems. Guarantee values of these algorithms are calculated in order to determine how the results returned by the algorithms are close to optimal solutions. Furthermore complementary problems for integer maximization KP and bounded integer maximization KP are defined, and it is aimed to improve the guarantee values which have been calculated before in terms of the complementary problems. © 2012 Copyright Taylor and Francis Group LLC. © 2012 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessComplementary Problem, Greedy Algorithms, Guarantee Value, Integer Programming, Knapsack ProblemsGuarantee ValueInteger ProgrammingGreedy AlgorithmsKnapsack ProblemsComplementary ProblemArticle