Research on online bin packing model with item size no more than 12

zbMATH Open1399.90033MaRDI QIDQ3132226FDOQ3132226

Authors: Minghui Zhang, Xin Han 

Publication date: 29 January 2018

Recommendations

• Online bin packing problem with buffer and bounded size revisited
• More on online bin packing with two item sizes
• Online bin packing with arbitrary release times
• A new and improved algorithm for online bin packing
• Online bin packing with \((1,1)\) and \((2,R)\) bins

zbMATH Keywords

bin packingonline algorithmasymptotic competitive ratioitem size partition

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cited In (3)

• NF-based algorithms for online bin packing with buffer and item size limitation
• Online bin packing problem with buffer and bounded size revisited
• More on online bin packing with two item sizes

This page was built for publication: Research on online bin packing model with item size no more than \(\frac{1}{2}\)

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