Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens - In: Optimization Letters 15 (2021) 8, pp. 2529-2540
We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or negative. We present the first fully polynomial-time...