Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
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.
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Arnold.L. Rosenberg
Journal of the ACM
Y.Y. Li, K.S. Leung, et al.
J Combin Optim