Asli GulerFidan NuriyevaGuler, AsliNuriyeva, Fidan2025-10-06201097899552859772-s2.0-84859571839https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859571839&partnerID=40&md5=fc4ca62d41241d726351c160c6b1eb0dhttps://gcris.yasar.edu.tr/handle/123456789/10299In this study one-dimensional Knapsack Problems which have many applications in economic area have been studied, then greedy algorithms have been discussed for these problems. Guarantee values of the algorithms have been calculated in order to determine how close the results returned by the algorithms are to optimal solutions. Furthermore complementary problem for Bounded Integer Maximization Knapsack Problem has been defined, and it has been aimed to improve the guarantee value calculated earlier in terms of the complementary problem. © Izmir University of Economics Turkey 2010. © 2014 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessComplementary Problem, Greedy Algorithms, Guarantee Value, Integer Programming, Knapsack Problems, Worst-case Analysis, Combinatorial Optimization, Integer Programming, Optimization, Complementary Problems, Greedy Algorithms, Guarantee Value, Knapsack Problems, Worst-case Analysis, AlgorithmsCombinatorial optimization, Integer programming, Optimization, Complementary problems, Greedy algorithms, Guarantee value, Knapsack problems, Worst-case analysis, AlgorithmsGuarantee ValueGreedy AlgorithmsInteger ProgrammingKnapsack ProblemsWorst-Case AnalysisComplementary ProblemConference Object