Optimal Resource Augmentations for Online Knapsack

DOI10.1007/978-3-540-74208-1_13MaRDI QIDQ3603464zbMATH OpenOpenAlexFDO

Authors Kazuo Iwama, Guochuan Zhang

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_13

zbMATH Keywords

knapsackon-line algorithmsresource augmentation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Online knapsack with resource augmentation
• scientific article; zbMATH DE number 7650261
• Online knapsack revisited
• Online knapsack revisited
• The online knapsack problem with incremental capacity
• Resource augmentation for online bounded space bin packing
• scientific article; zbMATH DE number 1670832
• Online bin packing with resource augmentation
• Approximation and Online Algorithms
• scientific article; zbMATH DE number 1839473

Cited in

(16)

• Online knapsack with resource augmentation
• Online resource management
• Online Knapsack Problem Under Concave Functions
• Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency
• The online knapsack problem with incremental capacity
• scientific article; zbMATH DE number 1839473 (Why is no real title available?)
• Unit cost buyback problem
• 2D knapsack: packing squares
• Online removable knapsack problem under convex function
• Online knapsack problem under concave functions
• Proportional Cost Buyback Problem with Weight Bounds
• Online Submodular Maximization Problem with Vector Packing Constraint.
• 2D knapsack: packing squares
• Randomized algorithms for online knapsack problems
• Online removable knapsack with limited cuts
• Online unweighted knapsack problem with removal cost

This page was built for publication: Optimal Resource Augmentations for Online Knapsack

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