Online knapsack with resource augmentation
From MaRDI portal
Publication:1675784
DOI10.1016/J.IPL.2010.08.013zbMATH Open1379.68361OpenAlexW2036102153MaRDI QIDQ1675784FDOQ1675784
Authors: Kazuo Iwama, Guochuan Zhang
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.013
Recommendations
Cites Work
Cited In (14)
- Online knapsack revisited
- Online resource management
- Randomized algorithms for removable online knapsack problems
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Packing a knapsack of unknown capacity
- The online knapsack problem: advice and randomization
- Online minimization knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online unweighted knapsack problem with removal cost
- Online knapsack problem with removal cost
- Optimal Resource Augmentations for Online Knapsack
- Online removable knapsack with limited cuts
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Proportional cost buyback problem with weight bounds
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)