https://doi.org/10.2307/2581283 • https://www.jstor.org/stable/2581283 Copy URL A preference order dynamic programming model proposed in the literature for solving ...
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