Approximation algorithms for the generalized incremental knapsack problem

We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack . In this setting, we are given a set of n items, each associated with a non-negative weight, and T time periods with non-decreasing capacities W 1 ≤ ⋯ ≤ W T . When ite...

Ausführliche Beschreibung