Stochastic on-line knapsack problems
From MaRDI portal
Recommendations
Cites work
- A probabilistic analysis of the multiknapsack value function
- A provably efficient algorithm for dynamic storage allocation
- Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
- Approximation algorithms for combinatorial problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3945879 (Why is no real title available?)
- scientific article; zbMATH DE number 4053339 (Why is no real title available?)
- scientific article; zbMATH DE number 4057285 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- Multi-constrained matroidal knapsack problems
- Probabilistic Analysis of the Multidimensional Knapsack Problem
- Probability Inequalities for Sums of Bounded Random Variables
- The average-case analysis of some on-line algorithms for bin packing
Cited in
(48)- Online knapsack with resource augmentation
- The advice complexity of a class of hard online problems
- A class of generalized greedy algorithms for the multi-knapsack problem
- Online budgeted maximum coverage
- Improved online algorithms for knapsack and GAP in the random order model
- Improved online algorithm for fractional knapsack in the random order model
- Fractionally subadditive maximization under an incremental knapsack constraint
- Online generalized assignment problem with historical information
- Online knapsack problem under concave functions
- Average-case performance of rollout algorithms for knapsack problems
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- The online knapsack problem: advice and randomization
- Online removable knapsack problem under convex function
- Online knapsack revisited
- The online knapsack problem with incremental capacity
- 2D knapsack: packing squares
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- scientific article; zbMATH DE number 4047112 (Why is no real title available?)
- 2D knapsack: packing squares
- Online removable knapsack with limited cuts
- Online Knapsack Problem Under Concave Functions
- Randomized algorithms for online knapsack problems
- Online unweighted knapsack problem with removal cost
- scientific article; zbMATH DE number 910873 (Why is no real title available?)
- A theory of auto-scaling for resource reservation in cloud services
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- Packing a knapsack of unknown capacity
- Improving LTL truck load utilization on line
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Algorithms for randomized time-varying knapsack problems
- Knapsack secretary through boosting
- Online knapsack with removal and recourse
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
- On two-stage stochastic knapsack problems
- Online unit profit knapsack with predictions
- An optimal algorithm for online multiple knapsack
- Online general knapsack with reservation costs
- Online simple knapsack with bounded predictions
- Removable online knapsack and advice
- A survey of online knapsack problems
- Online knapsack with removal and recourse
- Average sensitivity of the knapsack problem
- Online contention resolution schemes for size-stochastic knapsacks
- Online unbounded knapsack
- Online simple knapsack with reservation costs
- Online minimization knapsack problem
- On the sum minimization version of the online bin covering problem
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
This page was built for publication: Stochastic on-line knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804369)
