Analysis of a Hybrid Algorithm for Packing Unequal Bins

DOI10.1137/0217002MaRDI QIDQ3777479zbMATH OpenOpenAlexFDO

Authors Donald K. Friesen, F. S. Kuhl

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217002

zbMATH Keywords

heuristicapproximation algorithmbin-packingNP-hardworst-case performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Analysis of a Compound Bin Packing Algorithm
• Algorithmic analysis of priority-based bin packing
• An analysis of lower bound procedures for the bin packing problem
• Improved analysis of two algorithms for min-weighted sum bin packing
• Several methods of analysis for cardinality constrained bin packing
• Several methods of analysis for cardinality constrained bin packing
• A study on load-balanced variants of the bin packing problem

Cited in

(9)

• Algorithmic analysis of priority-based bin packing
• Deep performance analysis of refined harmonic bin packing algorithm
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
• scientific article; zbMATH DE number 3970110 (Why is no real title available?)
• Maximizing the number of unused bins
• Incremental bin packing
• Analysis of a Compound Bin Packing Algorithm
• Max-min bin packing algorithm and its application in nano-particles filling

This page was built for publication: Analysis of a Hybrid Algorithm for Packing Unequal Bins

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