Operations Research, Vol. 45, No. 5 (Sep. - Oct., 1997), pp. 758-767 (10 pages) Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such cases most of the ...

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

An algorithm which recursively generates the complete family of undominated feasible solutions to separable nonlinear multidimensional knapsack problems is developed by exploiting discontinuity ...