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 consider two knapsack problems which contain additional constraints in the form of directed graphs whose vertex set corresponds to the item set. In the one-neighbor knapsack...
