Cristina Cornelio, Judy Goldsmith, et al.
JAIR
The general knapsack problem is known to be NP-complete. In this paper a very special knapsack problem ia studied, namely, one with only two variables. A polynomial-time algorithm is presented and analyzed. However, it remains an open problem that for any fixed n > 2, the knapsack problem with n variables can be solved in polynomial time. © 1976, ACM. All rights reserved.
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Rie Kubota Ando
CoNLL 2006
Imran Nasim, Melanie Weber
SCML 2024
Yale Song, Zhen Wen, et al.
IJCAI 2013