Gurski, Frank; Komander, Dominique; Rehs, Carolin - In: Mathematical Methods of Operations Research 92 (2020) 2, pp. 401-433
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with weak digraph constraint (SSGW). In both problems there...
