Algorithms with guarantee value for Bounded Knapsack Problems

dc.contributor.author	Guler, A.
dc.contributor.author	Nuriyeva, F.
dc.date.accessioned	2021-01-25T20:51:42Z
dc.date.available	2021-01-25T20:51:42Z
dc.date.issued	2010
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859571839&partnerID=40&md5=fc4ca62d41241d726351c160c6b1eb0d
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10688
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 determin
dc.language.iso	English
dc.publisher	24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010
dc.title	Algorithms with guarantee value for Bounded Knapsack Problems
dc.type	Conference Paper
dc.relation.firstpage	183
dc.relation.lastpage	189
dc.description.affiliations	Department of Mathematics, Faculty of Science and Letter, Yasar University, Izmir, Turkey; Department of Mathematics, Faculty of Science, Ege University, Izmir, Turkey

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.