Testing integer knapsacks for feasibility

Testing integer knapsacks for feasibility

0.00 Avg rating0 Votes
Article ID: iaor19982423
Country: Netherlands
Volume: 88
Issue: 3
Start Page Number: 578
End Page Number: 582
Publication Date: Feb 1996
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: dynamic
Abstract:

We present a new approach for determining whether there exist nonnegative integers x1, x2, ..., xn satisfying a1x1+a2x2+...+anxn=b, where a1<a2<...<an and b are nonnegative integers. The worst case time complexity is analyzed and compared with dynamic programming techniques. Computational results are given.

Reviews

Required fields are marked *. Your email address will not be published.