A self organizing bin packing heuristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1619, Issue , 1999, Pages 245-265

  Csirik, Janos ^a   Johnson, David S ^b   Kenyon, Claire ^c   Shor, Peter W ^b   Weber, Richard R ^d  

^a UNIVERSITY OF SZEGED   (Hungary)

^b AT AND T LABS RESEARCH   (United States)

^c Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^d UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; LINEAR PROGRAMMING; PROBABILITY DISTRIBUTIONS;

AVERAGE-CASE BEHAVIOR; BIN PACKING; DISCRETE DISTRIBUTION; ONE DIMENSIONAL BIN PACKINGS; ONLINE LEARNING; OPTIMAL NUMBER; SINGLE PARAMETER; SUM OF SQUARES;

OPTIMIZATION;

EID: 84979082303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. J. L. Bentley, D. S. Johnson, F. T. Leighton, and C. C. McGeoch. An experimental study of bin packing. In Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, pages 51-60, Urbana, 1983. University of Illinois.
2. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis. Bin packing with discrete item sizes, part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Disc. Math. Submitted 1997.
3. E. G. Coffman, Jr., C. A. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. Mc-Geogh, P. W. Shor, R. R. Weber, and M. Yannakakis. Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 230-240. ACM Press, 1991.
4. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Bin packing with discrete item sizes, part IV: Average-case behavior of best fit. In preparation.
5. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Markov chains, computer proofs, and best fit bin packing. In Proceedings of the 25th ACM Symposium on the Theory of Computing, pages 412-421, New York, 1993. ACM Press.
6. E. G. Coffman, Jr. and G. S. Lueker. Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York, 1991.
7. C. Courcoubetis and R. R. Weber. Stability of on-line bin packing with random arrivals and long-run average constraints. Prob. Eng. Inf. Sci., 4:447-460, 1990.
8. C. Kenyon, Y. Rabani, and A. Sinclair. Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing. J. Algorithms, 27:218-235, 1998.
9. D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. 2nd Edition, Addison-Wesley, Reading, MA, 1981.
10. T. Leighton and P. Shor. Tight bounds for minimax grid matching with applications to the average case analysis of algorithms. Combinatorica, 9:161-187, 1989.
11. W. T. Rhee and M. Talagrand. On line bin packing with items of random size. Math. Oper. Res., 18:438-445, 1993.
12. W. T. Rhee and M. Talagrand. On line bin packing with items of random sizes - II. SIAM J. Comput., 22:1251-1256, 1993.
13. P. W. Shor. The average-case analysis of some on-line algorithms for bin packing. Combinatorica, 6(2):179-200, 1986.