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

DOI10.1016/J.CHAOS.2015.09.024zbMATH Open1360.68890OpenAlexW1952819075MaRDI QIDQ528368FDOQ528368

Authors: 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

Recommendations

• Analysis of a Hybrid Algorithm for Packing Unequal Bins
• The FFD algorithm for the bin packing problem with kernel items
• scientific article; zbMATH DE number 3970110
• scientific article; zbMATH DE number 4050974
• Two-Dimensional Finite Bin-Packing Algorithms

zbMATH Keywords

bin packingmax-minnano-particles filling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• Optimal analysis of best fit bin packing
• A stochastic analysis of the NFD bin-packing algorithm
• The Complete Convergence of Best Fit Decreasing

Cited In (1)

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

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

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