Online knapsack with resource augmentation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1306855 (Why is no real title available?)
- scientific article; zbMATH DE number 1559529 (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 910873 (Why is no real title available?)
- Resource augmentation for online bounded space bin packing
- Stochastic on-line knapsack problems
Cited in
(14)- Packing a knapsack of unknown capacity
- Online resource management
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Proportional cost buyback problem with weight bounds
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- The online knapsack problem: advice and randomization
- Optimal Resource Augmentations for Online Knapsack
- Randomized algorithms for removable online knapsack problems
- Online minimization knapsack problem
- Online knapsack problem with removal cost
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Online removable knapsack with limited cuts
- Online knapsack revisited
- Online unweighted knapsack problem with removal cost
This page was built for publication: Online knapsack with resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675784)
