A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
Theoretical Computer Science - Latin American theoretical informatics
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Online Algorithms for Multidimensional Packing Problems
SIAM Journal on Computing
Improved approximation algorithms for multidimensional bin packing problems
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Packing d-Dimensional Bins in d Stages
Mathematics of Operations Research
Improved online hypercube packing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
An on-line algorithm for multidimensional bin packing
Operations Research Letters
An approximation algorithm for square packing
Operations Research Letters
Multidimensional on-line bin packing: Algorithms and worst-case analysis
Operations Research Letters
Comparing several heuristics for a packing problem
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
A natural generalization of the classical online bin packing problem is the dynamic bin packing problem introduced by Coffman et al. (1983) [7]. In this formulation, items arrive and depart and the objective is to minimize the maximal number of bins ever used over all times. We study the oriented multi-dimensional dynamic bin packing problem for two dimensions, three dimensions and multiple dimensions. Specifically, we consider dynamic packing of squares and rectangles into unit squares and dynamic packing of three-dimensional cubes and boxes into unit cubes. We also study dynamic d-dimensional hypercube and hyperbox packing. For dynamic d-dimensional box packing we define and analyze the algorithm NFDH for the offline problem and present a dynamic version. This algorithm was studied before for rectangle packing and for square packing and was generalized only for multi-dimensional cubes. We present upper and lower bounds for each of these cases.