Algorithms with guarantee value for knapsack problems

Basit Öğe Kaydı
dc.contributor.authorGuler, Asli
dc.contributor.authorNuriyev, Urfat G.
dc.contributor.authorBerberler, Murat Ersen
dc.contributor.authorNuriyeva, Fidan
dc.date.accessioned2019-10-27T21:34:06Z
dc.date.available2019-10-27T21:34:06Z
dc.date.issued2012
dc.departmentEge Üniversitesien_US
dc.description24th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector -- JUN 23-26, 2010 -- Izmir Univ Econom, Izmir, TURKEYen_US
dc.description.abstractIn 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.en_US
dc.description.sponsorshipIzmir Chamber Commerce, Cent Bank Republ Turkey, European Off Aerosp Res & Dev (EOARD), EURO, Sci & Technol Res Council Turkey (TUBITAK), NETSIS Softwareen_US
dc.identifier.doi10.1080/02331934.2011.617818
dc.identifier.endpage488en_US
dc.identifier.issn0233-1934
dc.identifier.issn0233-1934en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage477en_US
dc.identifier.urihttps://doi.org/10.1080/02331934.2011.617818
dc.identifier.urihttps://hdl.handle.net/11454/45556
dc.identifier.volume61en_US
dc.identifier.wosWOS:000304274600009en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofOptimizationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectinteger programmingen_US
dc.subjectknapsack problemsen_US
dc.subjectgreedy algorithmsen_US
dc.subjectguarantee valueen_US
dc.subjectcomplementary problemen_US
dc.titleAlgorithms with guarantee value for knapsack problemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu