Answers are grounded in this paper and cite their sources.
Polynomial and fully polynomial approximation algorithms for single-dimensional knapsack problems have been extensively studied and a number of such algorithms constructed. This note shows that the problem of finding a fully polynomial approximation algorithm for multidimensional knapsack problems is NP-hard.
No takes yet. Share an insight, caveat, or question.
Magazine et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: