Approximation results for the incremental knapsack problem
From MaRDI portal
Publication:1642685
DOI10.1007/978-3-319-78825-8_7zbMath1504.90117OpenAlexW2799046353MaRDI QIDQ1642685
Ulrich Pferschy, Rosario Scatamacchia, Frederico Della Croce
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_7
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
New exact approaches and approximation results for the penalized knapsack problem ⋮ The longest processing time rule for identical parallel machines revisited ⋮ On approximating the incremental knapsack problem ⋮ A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem ⋮ Approximating the 3-period incremental knapsack problem
This page was built for publication: Approximation results for the incremental knapsack problem
