![]() ![]() Interestingly, this setting subsumes as special cases a number of recently-studied incremental knapsack problems, all known to be strongly NP-hard. The goal is to decide if and when to insert each item, subject to the time-dependent capacity constraints, with the objective of maximizing our total profit. When item i is inserted at time t, we gain a profit of pit however, this item remains in the knapsack for all subsequent periods. 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 W1≤ ⋯ ≤ WT. Hence, under widely believed complexity assumptions, this finding rules out the possibility that generalized incremental knapsack is APX-hard.Ībstract = "We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. Combined with further enumeration-based self-reinforcing ideas and new structural properties of nearly-optimal solutions, we turn our algorithm into a quasi-polynomial time approximation scheme (QPTAS). ![]() This result is based on a reformulation as a single-machine sequencing problem, which is addressed by blending dynamic programming techniques and the classical Shmoys–Tardos algorithm for the generalized assignment problem. Our first contribution comes in the form of a polynomial-time (12-ϵ)-approximation for the generalized incremental knapsack problem. ![]() When item i is inserted at time t, we gain a profit of p it however, this item remains in the knapsack for all subsequent periods. 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. We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |