This paper analyzes a heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal unit cost as large as possible. Recursive necessary and ...

Mathematics of Operations Research, Vol. 33, No. 4 (Nov., 2008), pp. 945-964 (20 pages) We consider a stochastic variant of the NP-hard 0/1 knapsack problem, in which item values are deterministic and ...