Algorithms with guarantee value for Bounded Knapsack Problems

dc.contributor.author Asli Guler
dc.contributor.author Fidan Nuriyeva
dc.contributor.author Guler, Asli
dc.contributor.author Nuriyeva, Fidan
dc.date.accessioned 2025-10-06T17:53:10Z
dc.date.issued 2010
dc.description.abstract In 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.
dc.identifier.isbn 9789955285977
dc.identifier.scopus 2-s2.0-84859571839
dc.identifier.uri https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859571839&partnerID=40&md5=fc4ca62d41241d726351c160c6b1eb0d
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/10299
dc.language.iso English
dc.publisher Vilnius Gediminas Technical University
dc.relation.ispartof 24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector MEC EurOPT 2010
dc.rights info:eu-repo/semantics/closedAccess
dc.subject Complementary 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, Algorithms
dc.subject Combinatorial optimization, Integer programming, Optimization, Complementary problems, Greedy algorithms, Guarantee value, Knapsack problems, Worst-case analysis, Algorithms
dc.subject Guarantee Value
dc.subject Greedy Algorithms
dc.subject Integer Programming
dc.subject Knapsack Problems
dc.subject Worst-Case Analysis
dc.subject Complementary Problem
dc.title Algorithms with guarantee value for Bounded Knapsack Problems
dc.type Conference Object
dspace.entity.type Publication
gdc.author.scopusid 55180616300
gdc.author.scopusid 55180262600
gdc.coar.type text::conference output
gdc.description.department
gdc.description.departmenttemp [Guler A.] Department of Mathematics, Faculty of Science and Letter, Yasar University, Izmir, Turkey; [Nuriyeva F.] Department of Mathematics, Faculty of Science, Ege University, Izmir, Turkey
gdc.description.endpage 189
gdc.description.publicationcategory Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
gdc.description.startpage 183
gdc.index.type Scopus
gdc.scopus.citedcount 2
gdc.virtual.author Serinken, Asli
oaire.citation.endPage 189
oaire.citation.startPage 183
person.identifier.scopus-author-id Guler- Asli (55180262600), Nuriyeva- Fidan (55180616300)
relation.isAuthorOfPublication ba06e0be-608f-456a-b538-376c1d982d8f
relation.isAuthorOfPublication.latestForDiscovery ba06e0be-608f-456a-b538-376c1d982d8f
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files