Online Bin Packing with Cardinality Constraints

DOI10.1137/050639065MaRDI QIDQ5426887zbMATH OpenOpenAlexFDO

Authors Leah Epstein

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

zbMATH Keywords

bin packingcardinality constraintsOnline algorithmsunbounded space online algorithms

Mathematics Subject Classification ID

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

Recommendations

• Algorithms – ESA 2005
• Online bin packing with cardinality constraints resolved
• Bounds for online bin packing with cardinality constraints
• Online bin packing with cardinality constraints resolved
• Algorithms for on-line bin-packing problems with cardinality constraints

Cited in

(33)

• 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
• Algorithms for on-line bin-packing problems with cardinality constraints
• 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
• Online bin packing with delay and holding costs
• 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
• Online bin packing with arbitrary release times
• Bounds for online bin packing with cardinality constraints
• Models for video-on-demand scheduling with costs
• On the online bin packing problem
• Selfish bin packing with cardinality constraints
• scientific article; zbMATH DE number 2081032 (Why is no real title available?)
• On-line bin packing ? A restricted survey
• Online bin packing with cardinality constraints resolved
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Algorithms – ESA 2005
• Several methods of analysis for cardinality constrained bin packing
• Several methods of analysis for cardinality constrained bin packing
• Online cardinality constrained scheduling
• Tighter bounds for the harmonic bin packing algorithm
• More on online cardinality constrained bin packing with small cardinality bounds
• Max-min and 1-bounded space algorithms for the bin packing problem
• Semi-online models for cardinality constrained bin packing
• Max-min and 1-bounded space algorithms for the bin packing problem
• Online unit clustering: Variations on a theme
• Online interval coloring with packing constraints
• Class constrained bin packing revisited

This page was built for publication: Online Bin Packing with Cardinality Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426887)