 Quadratic knapsack problem

The Quadratic Knapsack Problem (QKP) is an extension of the classic Knapsack Problem, which is a well-known optimization problem in combinatorial optimization. While the standard Knapsack Problem involves selecting items with given weights and values to maximize the total value without exceeding a weight capacity, the Quadratic Knapsack Problem adds an additional layer of complexity by considering the interactions between the items.