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 ...
An unbounded knapsack problem (KP) was investigated that describes the loading of items into a knapsack with a finite capacity, W, so as to maximize the total value of the loaded items. There were n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback