Answers are grounded in this paper and cite their sources.
This paper presents an algorithm for the solution of the knapsack problem. The method involves searching the nodes of a tree along a single branch at a time. The algorithm eliminates the computational drawbacks inherent in the usual branch and bound schemes.
No takes yet. Share an insight, caveat, or question.
Greenberg et al. (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: