A survey of online knapsack problems
From MaRDI portal
Cites work
- A Knapsack Secretary Problem with Applications
- A new measure for the study of on-line algorithms
- A probabilistic analysis of the multiknapsack value function
- An optimal algorithm for online multiple knapsack
- Approximation and online algorithms for multidimensional bin packing: a survey
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Beyond Competitive Analysis
- Beyond Competitive Analysis
- Competitive Caching with Machine Learned Advice
- Dynamic Programming and Decision Theory
- Fair versus unrestricted bin packing
- Finite Horizon Stochastic Knapsacks with Applications to Yield Management
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- How Much Information about the Future Is Needed?
- 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 1786227 (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?)
- scientific article; zbMATH DE number 7650261 (Why is no real title available?)
- scientific article; zbMATH DE number 7650400 (Why is no real title available?)
- Improved online algorithm for fractional knapsack in the random order model
- Improved online algorithms for knapsack and GAP in the random order model
- Information complexity of online problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Learning-augmented algorithms for online subset sum
- Lower bounds on the performance of online algorithms for relaxed packing problems
- Measuring the problem-relevant information in input
- On the Advice Complexity of Online Problems
- On the advice complexity of the \(k\)-server problem
- On the power of randomness versus advice in online computation
- Online algorithms with advice: the tape model
- Online algorithms: a survey
- Online computation with advice
- Online computation with untrusted advice
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Online knapsack problem under concave functions
- Online knapsack revisited
- Online knapsack with removal and recourse
- Online knapsack with resource augmentation
- Online minimization knapsack problem
- Online primal-dual algorithms for covering and packing
- Online removable knapsack problem under convex function
- Online removable knapsack with limited cuts
- Online simple knapsack with bounded predictions
- Online unbounded knapsack
- Online unit profit knapsack with predictions
- Online unweighted knapsack problem with removal cost
- Packing a knapsack of unknown capacity
- Primal beats dual on online packing LPs in the random-order model
- Randomized algorithms for online knapsack problems
- Reducibility among combinatorial problems
- Removable online knapsack and advice
- Semi-online scheduling: a survey
- Stochastic on-line knapsack problems
- The accommodating function: A generalization of the competitive ratio
- The dynamic and stochastic knapsack problem
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The online knapsack problem with incremental capacity
- The online knapsack problem: advice and randomization
- The online simple knapsack problem with reservation and removability
Cited in
(2)
This page was built for publication: A survey of online knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906721)
