1 citations · 1 across the 1 of their papers we have counts for
1 paper
Yuta Nakamura, Takashi Takahashi, Yoshiyuki Kabashima
Knapsack problem (KP) is a representative combinatorial optimization problem that aims to maximize the total profit by selecting a subset of items under given constraints on the to…