A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
An on-line algorithm for variable-sized bin packing
Acta Informatica
Improved bounds for harmonic-based bin packing algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Two-dimensional rectangle packing: on-line methods and results
Discrete Applied Mathematics - ARIDAM IV and V
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
New Algorithms for Bin Packing
Journal of the ACM (JACM)
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line grid-packing with a single active grid
Information Processing Letters
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-Line Grid-Packing with a Single Active Grid
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A 3-approximation algorithm for two-dimensional bin packing
Operations Research Letters
Hi-index | 0.00 |
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing.Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results, stated for d = 2, are as follows: A new upper bound of 2.66013 for online box packing, a new 14/9 + ε polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing.