On a multidimensional semi-on-line bin packing problem

MaRDI QIDQ2909025zbMATH OpenFDO

Authors János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt

Publication date 29 August 2012

zbMATH Keywords

worst case analysiscube packingmultidimensional bin packingsemi-on-line bin packing problems

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Integer programming (90C10)

Recommendations

• Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
• On-line bin packing with restricted repacking
• New bounds for multidimensional packing
• An on-line algorithm for multidimensional bin packing
• Algorithms for the on-line bin packing problem with repacking

Cited in

(5)

• Semi-on-line bin packing: a short overview and a new lower bound
• Algorithms for the on-line bin packing problem with repacking
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• On-line bin packing with restricted repacking

This page was built for publication: On a multidimensional semi-on-line bin packing problem

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