Cardinality constrained bin‐packing problems

@article{Kellerer1999CardinalityCB,
  title={Cardinality constrained bin‐packing problems},
  author={Hans Kellerer and Ulrich Pferschy},
  journal={Annals OR},
  year={1999},
  volume={92},
  pages={335-348}
}
We are concerned with a variant of the classical one-dimensional bin-packing problem. n items have to be packed into unit-capacity bins such that the total number of used bins is minimized with the additional constraint that at most k items can be assigned to one bin. In 1975, Krause et al. analyzed several approximation algorithms for this problem and showed that they all have an asymptotic worst-case performance ratio of 2. No better algorithms have been found so far. We present a new… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

An on-line algorithm for cardinality constrained bin packing problems

L. Babel, H. Kellerer
Technical Report 6y1998, Faculty of Economics, • 1998
View 1 Excerpt

Approximation algorithms for bin-packing – an updated survey

E. G. Coffman, M. R. Garey, D. S. Johnson
in: Analysis and Design of Algorithms in Combinatorial Optimization, eds. Ausiello and Lucertini, Springer, New York • 1984

L . Babel and H . Kellerer , An on - line algorithm for cardinality constrained bin packing problems , Technical Report 6 y 1998 , Faculty of Economics , University of Graz , submitted

M. R. Garey, D. S. Johnson
Approximation algorithms for bin - packing – an updated survey , in : Analysis and Design of Algorithms in Combinatorial Optimization • 1984

Luecker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1(1981)349–355

G.S.W. Fernandez de la Vega
1981
View 2 Excerpts

Near-optimal bin packing algorithms

D. S. Johnson
Doctoral Thesis, MIT, Cambridge, MA • 1973
View 2 Excerpts

Similar Papers

Loading similar papers…