Ghosh, D.; Chakravarti, N.; Sierksma, G. - Faculteit Economie en Bedrijfskunde, Rijksuniversiteit … - 2000
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results. If some uncertainty exists beforehand regarding the value of any one element in the...