0-1 Quadratic Knapsack Problem

Emerging

1papers using it

2025first seen

The 0-1 Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that involves selecting items with associated values and weights to maximize total value without exceeding a weight limit, where the interactions between items are represented by quadratic terms, and it is used to evaluate the performance

🔎 Find this dataset

Papers using 0-1 Quadratic Knapsack Problem (1)

A quantum search method for quadratic and multidimensional knapsack problems2025