.png){kind=icon}
.png){kind=icon}
Return
Parameterized on-line open-end bin packing
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02684336.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This note deals with a new variant of bin packing, the so-called open-end bin packing problem in which a bin can be filled to a level exceeding its capacity by its last item if it is not full immediately before the last is packed. We investigate the on-line version of this problem and give best possible algorithms for parametric cases.
Keywords:
bin packing
on-line algorithms
asymptotic worst-case performance ratio