International Journal of Applied Information Systems |
Foundation of Computer Science (FCS), NY, USA |
Volume 12 - Number 11 |
Year of Publication: 2018 |
Authors: Omar Kettani, Faical Ramdani |
10.5120/ijais2018451742 |
Omar Kettani, Faical Ramdani . Solving Knapsack Feasibility Problem via Nonnegative Least-Squares Approach. International Journal of Applied Information Systems. 12, 11 ( Feb 2018), 26-30. DOI=10.5120/ijais2018451742
In the present paper, a dynamic programming algorithm based on nonnegative least-squares approach is proposed to tackle the NP-hard knapsack feasibility problem. Some examples are presented to show the effectiveness of the proposed approach and a Matlab code implementation is provided in the appendix.