Multidimensional Bin Packing Algorithms

DOI10.1147/RD.215.0443MaRDI QIDQ4134959zbMATH OpenOpenAlexFDO

Authors Lawrence T. Kou, George Markowsky

Publication date 1977

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.215.0443

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Recommendations

• Models and complexity of multibin packing problems
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• scientific article; zbMATH DE number 21364
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• Optimal Online Algorithms for Multidimensional Packing Problems

Cited in

(14)

• Scheduling selfish jobs on multidimensional parallel machines
• Online interval coloring with packing constraints
• There is no asymptotic PTAS for two-dimensional vector packing
• Models and complexity of multibin packing problems
• Selfish vector packing
• Bidimensional Packing by Bilinear Programming
• Selfish vector packing
• Prospective network flow models and algorithms for bin packing problems
• Optimization algorithms for packing of small-lot correspondence in communication networks
• An MDD approach to multidimensional bin packing
• scientific article; zbMATH DE number 2221466 (Why is no real title available?)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• Resource allocation algorithms for virtualized service hosting platforms
• On-line bin packing ? A restricted survey

This page was built for publication: Multidimensional Bin Packing Algorithms

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