New Bounds for Variable-Sized Online Bin Packing

DOI10.1137/S0097539702412908zbMath1029.68084OpenAlexW1964501931MaRDI QIDQ4706213

Leah Epstein, Rob van Stee, Steven S. Seiden

Publication date: 19 June 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702412908

zbMATH Keywords

online algorithmsbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Related Items (9)

An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ Vector bin packing with multiple-choice ⋮ New lower bounds for certain classes of bin packing algorithms ⋮ Irreducible bin packing and normality in routing open shop ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Bin packing with controllable item sizes ⋮ Variable sized online interval coloring with bandwidth ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins

This page was built for publication: New Bounds for Variable-Sized Online Bin Packing