On-line bin packing with two item sizes
Keywords:
On-line algorithms, bin packing, competitive ratioAbstract
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items![](/static_content/AOR/vol1(2)2-1.gif)
![](/static_content/AOR/vol1(2)2-2.gif)
![](/static_content/AOR/vol1(2)2-3.gif)
![](/static_content/AOR/vol1(2)2-4.gif)
![](/static_content/AOR/vol1(2)2-5.gif)
![](/static_content/AOR/vol1(2)2-4.gif)
![](/static_content/AOR/vol1(2)2-6.gif)
![](/static_content/AOR/vol1(2)2-9.gif)
![](/static_content/AOR/vol1(2)2-7.gif)
![](/static_content/AOR/vol1(2)2-8.gif)
![](/static_content/AOR/vol1(2)2-10.gif)
Downloads
Published
2006-06-30
How to Cite
Gutin, G., Jensen, T., & Yeo, A. (2006). On-line bin packing with two item sizes. Algorithmic Operations Research, 1(2). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/667
Issue
Section
Articles