International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
Volume 12 - Issue 11 |
Published: Feb 2018 |
Authors: Omar Kettani, Faical Ramdani |
![]() |
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
@article{ 10.5120/ijais2018451742, author = { Omar Kettani,Faical Ramdani }, title = { Solving Knapsack Feasibility Problem via Nonnegative Least-Squares Approach }, journal = { International Journal of Applied Information Systems }, year = { 2018 }, volume = { 12 }, number = { 11 }, pages = { 26-30 }, doi = { 10.5120/ijais2018451742 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2018 %A Omar Kettani %A Faical Ramdani %T Solving Knapsack Feasibility Problem via Nonnegative Least-Squares Approach%T %J International Journal of Applied Information Systems %V 12 %N 11 %P 26-30 %R 10.5120/ijais2018451742 %I Foundation of Computer Science (FCS), NY, USA
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.