Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver

Renan F. F. da Silva, Thiago A. de Queiroz, Rafael C. S. Schouery

The Knapsack Problem (KP) and its generalization, the Bounded Knapsack Problem (BKP), are classical NP-hard problems with numerous practical applications, and despite being introdu…