2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Carolin Albrecht, Frank Gurski, Jochen Rethmann +1
The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP)…