Multidimensional Bin Packing Algorithms
From MaRDI portal
Publication:4134959
DOI10.1147/RD.215.0443zbMATH Open0361.68060OpenAlexW2018919141MaRDI QIDQ4134959FDOQ4134959
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
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)
- Online interval coloring with packing constraints
- Prospective network flow models and algorithms for bin packing problems
- Models and complexity of multibin packing problems
- Title not available (Why is that?)
- Resource allocation algorithms for virtualized service hosting platforms
- There is no asymptotic PTAS for two-dimensional vector packing
- Optimization algorithms for packing of small-lot correspondence in communication networks
- On-line bin packing ? A restricted survey
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Scheduling selfish jobs on multidimensional parallel machines
- An MDD approach to multidimensional bin packing
- Bidimensional Packing by Bilinear Programming
- Selfish vector packing
- Selfish vector packing
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)
