Algorithms with guarantee value for knapsack problems
| dc.contributor.author | Asli Guler | |
| dc.contributor.author | Urfat G. Nuriyev | |
| dc.contributor.author | Murat Ersen Berberler | |
| dc.contributor.author | Fidan Nuriyeva | |
| dc.coverage.spatial | 24th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector | |
| dc.date.accessioned | 2025-10-06T16:22:10Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | In 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. | |
| dc.identifier.doi | 10.1080/02331934.2011.617818 | |
| dc.identifier.issn | 0233-1934 | |
| dc.identifier.issn | 1029-4945 | |
| dc.identifier.uri | http://dx.doi.org/10.1080/02331934.2011.617818 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/7223 | |
| dc.language.iso | English | |
| dc.publisher | TAYLOR & FRANCIS LTD | |
| dc.relation.ispartof | 24th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector | |
| dc.source | OPTIMIZATION | |
| dc.subject | integer programming, knapsack problems, greedy algorithms, guarantee value, complementary problem | |
| dc.subject | SUM | |
| dc.title | Algorithms with guarantee value for knapsack problems | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.endpage | 488 | |
| gdc.description.startpage | 477 | |
| gdc.description.volume | 61 | |
| gdc.identifier.openalex | W2002467715 | |
| gdc.index.type | WoS | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.5841427E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | guarantee value | |
| gdc.oaire.keywords | knapsack problems | |
| gdc.oaire.keywords | greedy algorithms | |
| gdc.oaire.keywords | complementary problem | |
| gdc.oaire.keywords | integer programming | |
| gdc.oaire.popularity | 5.2417026E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0209 industrial biotechnology | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 2.0544 | |
| gdc.openalex.normalizedpercentile | 0.88 | |
| gdc.opencitations.count | 2 | |
| gdc.plumx.crossrefcites | 2 | |
| gdc.plumx.mendeley | 8 | |
| gdc.plumx.scopuscites | 3 | |
| oaire.citation.endPage | 488 | |
| oaire.citation.startPage | 477 | |
| person.identifier.orcid | Nuriyev- Urfat/0000-0002-3337-5859, | |
| publicationissue.issueNumber | 4 | |
| publicationvolume.volumeNumber | 61 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |