Abstract: The knapsack problem is known as a NP-hard problem. There is a dynamic programming solution for this problem which is called the 0–1 knapsack. Firefly's innovative optimization algorithm is ...

Fifteen 0-1 knapsack problems labelled L1 to L15 are used in this repository. L1 to L10 were extracted from low-dimensional instances found at [2], [3] and L11 to L15 from [4].

The "knapsack problem" is a widespread computing challenge—and no, it doesn't have to do just with literal backpacks. golubovy / iStock Imagine you’re a thief robbing a museum exhibit of tantalizing ...

Implement the "0/1 knapsack problem" using VQE/QAOA. The challenge is to find the Hamiltonian that encodes the problem to use in the VQE algorithm. The 0/1 knapsack problem: Given a set of items, each ...