Approximation results for the incremental knapsack problem

DOI10.1007/978-3-319-78825-8_7MaRDI QIDQ1642685zbMATH OpenOpenAlexFDO

Authors Ulrich Pferschy, Rosario Scatamacchia, F. Della Croce

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_7

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• On approximating the incremental knapsack problem
• Approximation algorithms for the generalized incremental knapsack problem
• Approximating the 3-period incremental knapsack problem
• A PTAS for the time-invariant incremental knapsack problem
• The online knapsack problem with incremental capacity

Cited in

(9)

• New exact approaches and approximation results for the penalized knapsack problem
• Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem
• A PTAS for the time-invariant incremental knapsack problem
• Approximation algorithms for the generalized incremental knapsack problem
• The online knapsack problem with incremental capacity
• On approximating the incremental knapsack problem
• The longest processing time rule for identical parallel machines revisited
• Approximating the 3-period incremental knapsack problem
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem

This page was built for publication: Approximation results for the incremental knapsack problem

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