Approximating single- and multi-objective nonlinear sum and product knapsack problems

Abstract

We present a fully polynomial-time approximation scheme (FPTAS) for a very general version of the well-known knapsack problem. This generalization covers, with few exceptions, all versions of knapsack problems that have been studied in the literature so far and allows for an objective function consisting of sums or products of possibly nonlinear, separable item profits, while the knapsack constraint states an upper bound on the sum of possibly nonlinear, separable item weights. Moreover, we extend our FPTAS to a multi-objective fully polynomial-time approximation scheme (MFPTAS) for the multi-objective version of the problem.

As applications of our general algorithms, we obtain the first FPTAS for the recently-introduced 0–1 time-bomb knapsack problem as well as FPTASs for a variety of robust knapsack problems. Moreover, we extend our FPTAS to the minimization version of our general problem, which, in particular, allows us to explicitly state an FPTAS for the classical minimization knapsack problem, which has been missing in the literature so far.