Algorithms with guarantee value for knapsack problems

Küçük Resim Yok

Tarih

2012

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Taylor & Francis Ltd

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Ö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 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.

Açıklama

24th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector -- JUN 23-26, 2010 -- Izmir Univ Econom, Izmir, TURKEY

Anahtar Kelimeler

integer programming, knapsack problems, greedy algorithms, guarantee value, complementary problem

Kaynak

Optimization

WoS Q Değeri

Q3

Scopus Q Değeri

Q1

Cilt

61

Sayı

4

Künye