Abstract
The multiple-choice knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of taking an item is replaced by the selection of exactly one item out of each class of items. In Section 7.1 we already noticed that a (BKP) can be formulated as a (MCKP), and indeed the (MCKP) model is one of the most flexible knapsack models. (MCKP) is also denoted as knapsack problem with generalized upper bound constraints or for short knapsack problem with GUB.
Cite
CITATION STYLE
Kellerer, H., Pferschy, U., & Pisinger, D. (2004). The Multiple-Choice Knapsack Problem. In Knapsack Problems (pp. 317–347). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
