Answers are grounded in this paper and cite their sources.
The multiple-choice knapsack problem is defined as a binary knapsack problem with the addition of disjoint multiple-choice constraints. The strength of the branch-and-bound algorithm we present for this problem resides with the quick solution of the linear programming relaxation and its efficient, subsequent reoptimization as a result of branching. An implemented version of this algorithm has performed well on a large set of test problems. We cite computational results as well as a comparison with a previously reported algorithm. Several useful applications of the multiple-choice knapsack problem are also suggested.
No takes yet. Share an insight, caveat, or question.
Sinha et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: