A PTAS for the time-invariant incremental knapsack problem

DOI10.1007/978-3-319-96151-4_14MaRDI QIDQ1661876zbMATH OpenOpenAlexFDO

Authors Yuri Faenza, Igor Malinović

Publication date 17 August 2018

Full work available at URL https://arxiv.org/abs/1701.07299

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Abstract: The Time-Invariant Incremental Knapsack problem (IIK) is a generalization of Maximum Knapsack to a discrete multi-period setting. At each time, capacity increases and items can be added, but not removed from the knapsack. The goal is to maximize the sum of profits over all times. IIK models various applications including specific financial markets and governmental decision processes. IIK is strongly NP-hard and there has been work on giving approximation algorithms for some special cases. In this paper, we settle the complexity of IIK by designing a PTAS based on rounding a disjuncive formulation, and provide several extensions of the technique.

Recommendations

• On approximating the incremental knapsack problem
• scientific article; zbMATH DE number 1445306
• Approximation algorithms for the generalized incremental knapsack problem
• Approximation results for the incremental knapsack problem
• An iterative dynamic programming approach for the temporal knapsack problem
• Constant-time approximation algorithms for the knapsack problem
• An FPTAS for the parametric knapsack problem
• Algorithms for randomized time-varying knapsack problems
• The Temporal Knapsack Problem and Its Solution
• Approximating the 3-period incremental knapsack problem

Cited in

(7)

• Approximation results for the incremental knapsack problem
• Approximating the 3-period incremental knapsack problem
• Approximation schemes for multiperiod binary knapsack problems
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• On approximating the incremental knapsack problem
• Approximation algorithms for the generalized incremental knapsack problem
• Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem

This page was built for publication: A PTAS for the time-invariant incremental knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661876)