Algorithms with guarantee value for knapsack problems
Tarih
2012Yazar
Guler, A.
Nuriyev, U.G.
Berberler, M.E.
Nuriyeva, F.
Üst veri
Tüm öğe kaydını gösterÖzet
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 deter
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..