Online knapsack with resource augmentation

DOI10.1016/j.ipl.2010.08.013zbMath1379.68361OpenAlexW2036102153MaRDI QIDQ1675784

Kazuo Iwama, Guo-Chuan 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

zbMATH Keywords

online algorithmsknapsackresource augmentation

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ Online minimization knapsack problem ⋮ Proportional cost buyback problem with weight bounds ⋮ The online knapsack problem: advice and randomization ⋮ Online knapsack revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic on-line knapsack problems
• Resource augmentation for online bounded space bin packing

This page was built for publication: Online knapsack with resource augmentation