A Total-Value Greedy Heuristic for the Integer Knapsack Problem