For the 0-1 knapsack problem with equality constraint a partitioning procedure is introduced which focuses on the core of the problem. The purpose of the procedure is to reduce the required ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback