Key points are not available for this paper at this time.
Abstract A unifying survey of the literature related to the knapsack problem; that is, maximize articleemptydocument ᵢ vᵢ x₈, document, subject to articleemptydocument ⱼ wᵢ xᵢ W document and x i ⩾ 0, integer; where v i, w i and W are known integers, and w i (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi‐dimensional case, are also considered.
Salkin et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: