Guler, AsliNuriyev, Urfat G.Berberler, Murat ErsenNuriyeva, Fidan2019-10-272019-10-2720120233-19340233-1934https://doi.org/10.1080/02331934.2011.617818https://hdl.handle.net/11454/4555624th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector -- JUN 23-26, 2010 -- Izmir Univ Econom, Izmir, TURKEYIn 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.en10.1080/02331934.2011.617818info:eu-repo/semantics/closedAccessinteger programmingknapsack problemsgreedy algorithmsguarantee valuecomplementary problemArticle614477488WOS:000304274600009Q1Q3