The colored knapsack problem: structural properties and exact algorithms

Fabio Ciccarelli, Alexander Helber, Erik Mühmer

We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into cla…