Goebbels, Steffen; Gurski, Frank; Komander, Dominique - In: Mathematical Methods of Operations Research 95 (2021) 1, pp. 1-34
The knapsack problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We … to the item set. In the one-neighbor knapsack problem, an item can be chosen only if at least one of its neighbors is … chosen. In the all-neighbors knapsack problem, an item can be chosen only if all its neighbors are chosen. For both problems …
