Mathematical models and decomposition methods for the multiple knapsack problem

Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello
2019 European Journal of Operational Research  
We consider the multiple knapsack problem, that calls for the optimal assignment of a set of items, each having a profit and a weight, to a set of knapsacks, each having a maximum capacity. The problem has relevant managerial implications and is known to be very difficult to solve in practice for instances of realistic size. We review the main results from the literature, including a classical mathematical model and a number of improvement techniques. We then present two new pseudo-polynomial
more » ... rmulations, together with specifically tailored decomposition algorithms to tackle the practical difficulty of the problem. Extensive computational experiments show the effectiveness of the proposed approaches.
doi:10.1016/j.ejor.2018.10.043 fatcat:mwwhzwgmd5hb7oekjgxpx7rkcm