An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
From MaRDI portal
Publication:2753537
DOI10.1137/S0895480100369948zbMath0992.68248WikidataQ105584153 ScholiaQ105584153MaRDI QIDQ2753537
Publication date: 11 November 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Online bin packing with overload cost ⋮ More on batched bin packing ⋮ Bin packing with controllable item sizes ⋮ Variable sized online interval coloring with bandwidth ⋮ The variable-width strip packing problem
This page was built for publication: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
