Online knapsack problem under concave functions

DOI10.1016/J.TCS.2018.03.025MaRDI QIDQ2319907zbMATH OpenOpenAlexFDO

Authors Xin Han, Qinyang Chen, Kazuhisa Makino

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

zbMATH Keywords

competitive ratioknapsack problemsonline algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• Online Knapsack Problem Under Concave Functions
• Online removable knapsack problem under convex function
• Online minimization knapsack problem
• Online minimization knapsack problem
• Online knapsack revisited
• Online knapsack revisited
• The online knapsack problem with incremental capacity
• Online Knapsack Problems with Limited Cuts
• Stochastic on-line knapsack problems

Cites work

• Finite-State Online Algorithms and Their Automated Competitive Analysis
• 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?)
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Online knapsack revisited
• Online minimization knapsack problem
• Online removable knapsack problem under convex function
• Online removable knapsack with limited cuts
• Online unweighted knapsack problem with removal cost
• Optimal Resource Augmentations for Online Knapsack
• Packing a knapsack of unknown capacity
• Proportional Cost Buyback Problem with Weight Bounds
• Randomized algorithms for online knapsack problems
• Stochastic on-line knapsack problems
• The online knapsack problem with incremental capacity

Cited in

(8)

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Online removable knapsack problem under convex function
• How to pack your items when you have to buy your knapsack
• Online Knapsack Problems with Limited Cuts
• Online Knapsack Problem Under Concave Functions
• A survey of online knapsack problems
• Online knapsack with removal and recourse
• Lower bounds on the performance of online algorithms for relaxed packing problems

This page was built for publication: Online knapsack problem under concave functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319907)