Search
Now showing items 1-2 of 2
Sensitivity analysis of the greedy heuristic for binary knapsack problems
(2006-10-27)
Greedy heuristics are a popular choice of heuristics when we have to solve
a large variety of N P-hard combinatorial problems. In particular for binary
knapsack problems, these heuristics generate good results. If some ...