NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation

DOI10.1007/978-3-319-03780-6_3zbMath1407.90281OpenAlexW25837695MaRDI QIDQ2867105

No author found.

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_3

zbMATH Keywords

online algorithmbin packingasymptotic competitive ratio

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More on online bin packing with two item sizes
• Repacking helps in bounded space on-line bin-packing
• Linear time-approximation algorithms for bin packing
• Dynamic bin packing with unit fraction items revisited
• Fast algorithms for bin packing
• On-line bin packing with restricted repacking
• Algorithms for the Relaxed Online Bin-Packing Model
• New Lower Bounds for Certain Classes of Bin Packing Algorithms
• On the online bin packing problem
• Dynamic Bin Packing
• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing in linear time
• On-line bin packing ? A restricted survey

This page was built for publication: NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation