Online bin packing with cardinality constraints

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 4, 2007, Pages 1015-1030

  Epstein, Leah ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Bin packing; Cardinality constraints; Online algorithms

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ONLINE SYSTEMS; PROBLEM SOLVING;

BIN PACKING; CARDINALITY CONSTRAINTS; ONLINE ALGORITHMS;

DATA STORAGE EQUIPMENT;

EID: 36248987770     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050639065     Document Type: Article

References (23)

1. L. BABEL, B. CHEN, H. KELLERER, AND V. KOTOV, Algorithms for on-line bin-packing problems with cardinality constraints, Discrete Appl. Math., 143 (2004), pp. 238-251.
2. A. CAPRARA, H. KELLERER, AND U. PFERSCHY, Approximation schemes for ordered vector packing problems, Naval Research Logistics, 92 (2003), pp. 58-69.
3. E. G. COFFMAN, M. R. GAREY, AND D. S. JOHNSON, Approximation algorithms for bin packing: A survey, in Approximation Algorithms, D. Hochbaum, ed., PWS Publishing Company, Boston, 1997, pp. 46-93.
4. J. CSIRIK, An online algorithm for variable-sized bin packing, Acta Inform., 26 (1989), pp. 697-709.
5. J. CSIRIK AND G. J. WOEGINGER, On-line packing and covering problems, in Online Algorithms: The State of the Art, A. Fiat and G. J. Woeginger, eds., Lecture Notes in Comput. Sci. 1442, Springer, NY, 1998, pp. 147-177.
6. J. CSIRIK AND G. J. WOEGINGER, Resource augmentation for online bounded space bin packing, J. Algorithms, 44 (2002), pp. 308-320.
7. L. EPSTEIN AND R. VAN STEE, On variable-sized multidimensional packing, in Proceedings of the 12th Annual European Symposium on Algorithms (ESA2004), Bergen, Norway, 2004, Lecture Notes in Comput. Sci. 3221, Springer, New York, 2004, pp. 287-298.
8. L. EPSTEIN AND R. VAN STEE, Online bin packing with resource augmentation, in Proceedings of the 2nd Workshop on Approximation and Online Algorithms (WAOA 2004), Bergen, Norway, 2004, Lecture Notes in Comput. Sci. 3351, Springer, New York, 2004, pp. 48-60.
9. L. EPSTEIN AND R. VAN STEE, Optimal online bounded space multidimensional packing, in Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), New Orleans, LA, 2004, SIAM, Philadelphia, 2004, pp. 207-216.
10. D. K. FRIESEN AND M. A. LANGSTON, Variable sized bin packing, SIAM J. Comput., 15 (1986), pp. 222-230.
11. D. S. JOHNSON, Fast algorithms for bin packing, J. Comput. System Sci., 8 (1974), pp. 272-314.
12. H. KELLERER AND U. PFERSCHY, Cardinality constrained bin-packing problems, Ann. Oper. Res., 92 (1999), pp. 335-348.
13. K. L. KRAUSE, V. Y. SHEN, AND H. D. SCHWETMAN, Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, J. ACM, 22 (1975), pp. 522550.
14. K. L. KRAUSE, V. Y. SHEN, AND H. D. SCHWETMAN, Errata: "Analysis of several taskscheduling algorithms for a model of multiprogramming computer systems, J. ACM, 24 (1977), pp. 527-527.
15. C. C. LEE AND D. T. LEE. A simple online bin packing algorithm, J. ACM, 32 (1985), pp. 562572.
16. P. RAMANAN, D. J. BROWN, C. C. LEE, AND D. T. LEE, Online bin packing in linear time, J. Algorithms, 10 (1989), pp. 305-326.
17. S. S. SEIDEN, An optimal online algorithm for bounded space variable-sized bin packing, SIAM J. Discrete Math., 14 (2001), pp. 458-470.
18. S. S. SEIDEN, On the online bin packing problem, J. ACM, 49 (2002), pp. 640-671.
19. S. S. SEIDEN, R. VAN STEE, AND L. EPSTEIN, New bounds for variable-sized online bin packing, SIAM J. Comput., 32 (2003), pp. 455-469.
20. J. D. ULLMAN, The Performance of a Memory Allocation Algorithm, Technical Report 100, Princeton University, Princeton, NJ, 1971.
21. A. VAN VLIET, An improved lower bound for online bin packing algorithms, Inform. Process. Lett., 43 (1992), pp. 277-284.
22. G. WOEGINGER, Improved space for bounded-space, online bin packing, SIAM J. Discrete Math., 6 (1993), pp. 575-581.
23. A. C. C. YAO, New algorithms for bin packing, J. ACM, 27 (1980), pp. 207-227.