A new procedure for the calculation of the compartmented knapsack problem

It considers the classic knapsack problem. It admits that items must be grouped in subgroups, and items of a grouping cannot be matched with items of another grouping. The Compartmented Knapsack Problem consists of constructing compartments, whose dimensions are limited and must be determined, and where each one of them is formed by items of some grouping. This is a new variation of knapsack that has been studied in cutting-stock problems. We present in this paper its mathematical formularization and a resolution method, and as alternative we consider a heuristic procedure to resolve the problem.