Online removable knapsack problem under convex function

DOI10.1016/j.tcs.2013.09.013zbMath1360.68909OpenAlexW2082721953MaRDI QIDQ2453163

Yasushi Kawase, He Guo, Kazuhisa Makino, Xin Han

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.013

zbMATH Keywords

online algorithmscompetitive ratioknapsack problems

Mathematics Subject Classification ID

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

Related Items (10)

Packing a Knapsack of Unknown Capacity ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ Proportional cost buyback problem with weight bounds ⋮ Online Knapsack Problem Under Concave Functions ⋮ Proportional Cost Buyback Problem with Weight Bounds ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem ⋮ Online knapsack revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic on-line knapsack problems
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Online Minimization Knapsack Problem
• Optimal Resource Augmentations for Online Knapsack
• Online Knapsack Problems with Limited Cuts
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

This page was built for publication: Online removable knapsack problem under convex function