An exact algorithm for large knapsack sharing problems

• Published in: INFOR. Information systems and operational research Vol. 60; no. 3; pp. 315 - 341
• Main Authors: Laalaoui, Yacine, Mhalla, Hedi
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 25.07.2022
• Subjects: critical class; dichotomous search; exact algorithm; Knapsack sharing; large instances

The Knapsack Sharing Problem (KSP) is the problem of assigning a subset of n items from m disjoint classes to a shared knapsack such that the total profit of the smallest class is maximized subject to the knapsack capacity constraint. The KSP problem generalizes the 0/1 Knapsack Problem (KP), and it...