More on online bin packing with two item sizes

We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, where both item sizes are bounded from above by 1

• Type: Journal
• Year: 2008
• Where: DISOPT
• Authors: Leah Epstein, Asaf Levin
• Keywords: DISOPT 2008, Online Bin, Possible Sizes