Max-min bin packing algorithm and its application in nano-particles filling

DOI10.1016/J.CHAOS.2015.09.024zbMath1360.68890OpenAlexW1952819075MaRDI QIDQ528368

Dingju Zhu

Publication date: 12 May 2017

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2015.09.024

zbMATH Keywords

bin packingmax-minnano-particles filling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Related Items (1)

The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Cites Work

• Unnamed Item
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• A stochastic analysis of the NFD bin-packing algorithm
• The Complete Convergence of Best Fit Decreasing
• Optimal Analysis of Best Fit Bin Packing

This page was built for publication: Max-min bin packing algorithm and its application in nano-particles filling