A total-value greedy heuristic for the integer knapsack problem

This paper examines a new greedy heuristic for the integer knapsack problem. The proposed heuristic selects items in non-increasing order of their maximum possible contribution to the solution value given the available knapsack capacity at each step. The lower bound on the performance ratio for this ‘total-value’ greedy heuristic is shown to dominate the correspoding lower bound for the density-ordered greedy heuristic.