An exact algorithm for the knapsack sharing problem with common items

We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As usual, each item is associated with its profit and weight, and the problem is to determine the subset of items to be packed into the knapsack. However, in the problem there are s players and the items are divided into s + 1 disjoint groups, Nk (k = 0,1, . . . ,s). The player k is concerned only with the items in N0 [ Nk, where N0 is the set of

• Type: Journal
• Year: 2006
• Where: EOR
• Authors: Masako Fujimoto, Takeo Yamada
• Keywords: Disjoint Groups, EOR 2006, Knapsack, Knapsack Problem