Online knapsack problem under concave functions
From MaRDI portal
Publication:2319907
DOI10.1016/j.tcs.2018.03.025zbMath1429.68334OpenAlexW2617159737MaRDI QIDQ2319907
Kazuhisa Makino, Qinyang Chen, Xin Han
Publication date: 20 August 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.025
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online knapsack revisited
- The online knapsack problem with incremental capacity
- Online removable knapsack with limited cuts
- Randomized algorithms for online knapsack problems
- Online unweighted knapsack problem with removal cost
- Online minimization knapsack problem
- Stochastic on-line knapsack problems
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Online removable knapsack problem under convex function
- Optimal Resource Augmentations for Online Knapsack
- Packing a Knapsack of Unknown Capacity
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Proportional Cost Buyback Problem with Weight Bounds
This page was built for publication: Online knapsack problem under concave functions