The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number ...

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

The Journal of the Operational Research Society, Vol. 57, No. 6 (Jun., 2006), pp. 718-726 (9 pages) In this paper, we propose a reactive local search-based algorithm for the disjunctively constrained ...