Algorithms for the on-line bin packing problem with repacking

MaRDI QIDQ5422515zbMATH OpenFDO

Authors János Balogh, Gábor Galambos

Publication date 26 October 2007

zbMATH Keywords

on-line bin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On-line bin packing with restricted repacking
• On a multidimensional semi-on-line bin packing problem
• Repacking helps in bounded space on-line bin-packing
• Algorithms for the relaxed online bin-packing model
• Resource augmented semi-online bounded space bin packing

Cited in

(6)

• Robust online algorithms for dynamic choosing problems
• NF-based algorithms for online bin packing with buffer and bounded item size
• On-line bin packing with restricted repacking
• Algorithms for the relaxed online bin-packing model
• NF-based algorithms for online bin packing with buffer and item size limitation
• On a multidimensional semi-on-line bin packing problem

This page was built for publication: Algorithms for the on-line bin packing problem with repacking

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