Packing a Knapsack of Unknown Capacity

DOI10.4230/LIPIcs.STACS.2014.276zbMath1359.90115OpenAlexW1773078492MaRDI QIDQ2965490

Yann Disser, Nicole Megow, Sebastian Stiller, Max Klimm

Publication date: 3 March 2017

Full work available at URL: https://arxiv.org/pdf/1307.2806

zbMATH Keywords

robustnessapproximation algorithmsknapsackunknown capacity

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

Packing a Knapsack of Unknown Capacity ⋮ The online knapsack problem with incremental capacity ⋮ Decomposition approaches for recoverable robust optimization problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ Robust Randomized Matchings

This page was built for publication: Packing a Knapsack of Unknown Capacity