The online knapsack problem with incremental capacity

DOI10.1007/S00186-015-0526-9MaRDI QIDQ283993zbMATH OpenOpenAlexFDO

Authors Clemens Thielen, Morten Tiedemann, Stephan Westphal

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

online optimizationcompetitive analysisdynamic capacityknapsack problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Randomized algorithms for online knapsack problems
• Approximation results for the incremental knapsack problem
• Approximation algorithms for the generalized incremental knapsack problem
• Online resource management
• Online knapsack revisited

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1256669 (Why is no real title available?)
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Knapsack Secretary Problem with Applications
• An Incremental Model for Combinatorial Maximization Problems
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Constant-time approximation algorithms for the knapsack problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management
• Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
• On-line competitive algorithms for call admission in optical networks
• Optimal Resource Augmentations for Online Knapsack
• Packing a knapsack of unknown capacity
• Randomized algorithms for online knapsack problems
• Reducibility among combinatorial problems
• Stochastic on-line knapsack problems
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• The dynamic and stochastic knapsack problem

Cited in

(12)

• Packing a knapsack of unknown capacity
• Approximation results for the incremental knapsack problem
• Online resource management
• Online Knapsack Problem Under Concave Functions
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Fractionally subadditive maximization under an incremental knapsack constraint
• Online Knapsack Problems with Limited Cuts
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
• Optimal Resource Augmentations for Online Knapsack
• On approximating the incremental knapsack problem
• Online knapsack problem under concave functions
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones

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

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