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 ...

Computational experience with an algorithm based on the above ideas, on several hundred randomly generated test problems with 1,000-10,000 variables and with coefficients ranging from between 10 and ...