Online Colored Bin Packing

DOI10.1007/978-3-319-18263-6_4zbMath1386.68228arXiv1404.5548OpenAlexW1781979225MaRDI QIDQ3453281

Pavel Veselý, Jiří Sgall, Martin Böhm

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5548

Mathematics Subject Classification ID

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

Related Items (9)

Black and White Bin Packing Revisited ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Online dominating set ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ Selfish colorful bin packing games ⋮ Bin packing with directed stackability conflicts ⋮ Locality-preserving allocations problems and coloured bin packing ⋮ Offline black and white bin packing

Cites Work

• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• Online results for black and white bin packing
• Black and White Bin Packing
• Two-Bounded-Space Bin Packing Revisited
• Colorful Bin Packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• Optimal Analysis of Best Fit Bin Packing
• Bounded space on-line bin packing: Best is better than first

This page was built for publication: Online Colored Bin Packing