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

We show this build problem is NP-hard which indicates the necessity of efficient heuristic solution procedures. This paper considers several "greedy" type algorithms based on grouping parts according ...