Models and algorithms for the Multiple Knapsack problem with conflicts

In the Multiple Knapsack Problem with Conflicts, we are given a set of items, each with its own weight and profit, as well as a set of multiple knapsacks, each with its own capacity. The goal is to maximize the total profit of the items inserted in the knapsacks, while respecting the knapsack capacity and the incompatibility constraints between items.. The thesis is based on Basnet2018 research article. I developed some heuristic algorithms and tested them with various instances with a maximum case of 500 items and 15 knapsacks. The results of the computations are reported.