On the Online Bin Packing Problem-Reference-Cited by-同舟云学术

On the Online Bin Packing Problem

Published:2001 Issue: Volume: Page:237-248
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Seiden Steven S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48224-5_20

Reference14 articles.

1. Brown, D. J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979.

2. Coffman, E. G., Garey, M. R., AND Johnson, D. S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbuam, Ed. PWS Publishing Company, 1997, ch. 2.

3. Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26, 8 (1989), 697–709.

4. Lect Notes Comput Sci;J. a. Csirik,1998

5. Csirik, J., AND Woeginger, G. Resource augmentation for online bounded space bin packing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (Jul 2000), pp. 296–304.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The variable-width strip packing problem;Central European Journal of Operations Research;2021-08-30

2. Optimal Algorithm for Maintaining Equipment Loading;Communications in Computer and Information Science;2012

3. Algorithms for on-line bin-packing problems with cardinality constraints;Discrete Applied Mathematics;2004-09

4. New Bounds for Variable-Sized and Resource Augmented Online Bin Packing;Automata, Languages and Programming;2002

5. Removable Online Knapsack Problems;Automata, Languages and Programming;2002