Approximation Algorithms for the Weight-Reducible Knapsack Problem

DOI10.1007/978-3-319-06089-7_14zbMath1405.68443OpenAlexW2098281589MaRDI QIDQ5410644

Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06089-7_14

zbMATH Keywords

knapsack problemapproximation algorithmsimprovable optimization problems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Decomposition approaches for recoverable robust optimization problems ⋮ The robust knapsack problem with queries

This page was built for publication: Approximation Algorithms for the Weight-Reducible Knapsack Problem