Models and algorithms for the Multiple Knapsack problem with conflicts

Chakka, Varun Raj (2022) Models and algorithms for the Multiple Knapsack problem with conflicts. [Laurea magistrale], Università di Bologna, Corso di Studio in Automation engineering / ingegneria dell’automazione [LM-DM270], Documento full-text non disponibile
Il full-text non è disponibile per scelta dell'autore. (Contatta l'autore)


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.

Tipologia del documento
Tesi di laurea (Laurea magistrale)
Autore della tesi
Chakka, Varun Raj
Relatore della tesi
Corso di studio
Ordinamento Cds
Parole chiave
multiple knapsack, heuristic algorithms, incompatibility constraints, profits, weights
Data di discussione della Tesi
21 Marzo 2022

Altri metadati

Gestione del documento: Visualizza il documento