.png){kind=icon}
.png){kind=icon}
Return
Testing integer knapsacks for feasibility
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)00214-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new approach for determining whether there exist nonnegative integers x(1), x(2),...x(n) satisfying a(1)x(1) + a(2)x(2) +...+ a(n)x(n) = b where a(1) < a(2) <...< a(n) and b are nonnegative integers. The worst case time complexity is analyzed and compared with dynamic programming techniques. Computational results are given.
Keywords:
knapsack problems
group problem
feasibility testing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available