Title of article :
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
Author/Authors :
Michael M. Güntzer، نويسنده , , Dieter Jungnickel، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2000
Pages :
12
From page :
55
To page :
66
Keywords :
0=1 Knapsack Problem , Subset-Sum Problem , approximation , greedy algorithms
Journal title :
Operations Research Letters
Serial Year :
2000
Journal title :
Operations Research Letters
Record number :
137219
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=137219
بازگشت