An exact algorithm for the knapsack sharing problem

In this paper, we develop an exact algorithm for solving the knapsack sharing problem. The algorithm is a new version of the method proposed by Hifi and Sadfi. It seems quite efficient in the sense that it solves quickly some large problem instances. Its main principle consists of (i) finding a good set of capacities, representing a set of critical elements, using a heuristic approach, and (ii) varying the values of the obtained set in order to stabilize the optimal solution of the problem. Then, by exploiting dynamic programming properties, we obtain good equilibrium which leads to significant improvements. The performance of the proposed algorithm, based on a set of medium and large problem instances, is compared to the standard version of Hifi and Sadfi. Encouraging results have been obtained.