PFKP: A fast algorithm to solve knapsack problem on multi-core system
ZY Mohammed, MW Al-Neama - AIP Conference Proceedings, 2023 - pubs.aip.org
The 0/1 Knapsack Problem (KP) is an optimization problem that involves presenting a
dataset 𝑆 of items with predetermined benefits and weights. The goal is to select a subset S …
dataset 𝑆 of items with predetermined benefits and weights. The goal is to select a subset S …