Online Bin Packing with Cardinality Constraints
From MaRDI portal
Publication:5426887
DOI10.1137/050639065zbMath1130.68063MaRDI QIDQ5426887
Publication date: 16 November 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050639065
Related Items
Unnamed Item, Approximation Schemes for Packing Splittable Items with Cardinality Constraints, Lower bounds for several online variants of bin packing, Models for video-on-demand scheduling with costs, Selfish bin packing with cardinality constraints, Online unit clustering: Variations on a theme, Online interval coloring with packing constraints, Class constrained bin packing revisited, The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints, Colored bin packing: online algorithms and lower bounds, More on batched bin packing, Online bin packing with cardinality constraints resolved, Constructive heuristics for the canister filling problem, Improved lower bounds for the online bin packing problem with cardinality constraints, Approximation schemes for packing splittable items with cardinality constraints, Bin packing with general cost structures, Improved results for a memory allocation problem, Bin covering with cardinality constraints, Bounds for online bin packing with cardinality constraints
