The online knapsack problem with incremental capacity

DOI10.1007/S00186-015-0526-9zbMath1346.90722OpenAlexW2214256523MaRDI QIDQ283993

Stephan Westphal, Clemens Thielen, Morten Tiedemann

Publication date: 17 May 2016

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-015-0526-9

zbMATH Keywords

competitive analysisonline optimizationdynamic capacityknapsack problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (8)

Packing a Knapsack of Unknown Capacity ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ On approximating the incremental knapsack problem ⋮ Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows ⋮ Online Knapsack Problem Under Concave Functions ⋮ Online knapsack problem under concave functions ⋮ Fractionally subadditive maximization under an incremental knapsack constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized algorithms for online knapsack problems
• Stochastic on-line knapsack problems
• The Dynamic and Stochastic Knapsack Problem
• Constant-Time Approximation Algorithms for the Knapsack Problem
• Packing a Knapsack of Unknown Capacity
• Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
• A Knapsack Secretary Problem with Applications
• Optimal Resource Augmentations for Online Knapsack
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management
• On-line competitive algorithms for call admission in optical networks
• Reducibility among Combinatorial Problems
• An Incremental Model for Combinatorial Maximization Problems

This page was built for publication: The online knapsack problem with incremental capacity