Packing a knapsack of unknown capacity

DOI10.4230/LIPICS.STACS.2014.276zbMATH Open1359.90115OpenAlexW1773078492MaRDI QIDQ2965490FDOQ2965490

Authors: Y. Disser, Max Klimm, Nicole Megow, Sebastian Stiller 

Publication date: 3 March 2017

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

Recommendations

• Packing a knapsack of unknown capacity
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• A nonlinear knapsack problem
• The continuous knapsack problem with capacities
• Submodular maximization with uncertain knapsack capacity

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)

Cited In (6)

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

This page was built for publication: Packing a knapsack of unknown capacity

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