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 ...
Since Balas and Zemel in the 1980s introduced the so-called core problem as an efficient tool for solving the Knapsack Problem, all the most successful algorithms have applied this concept. Balas and ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback