Tight bounds for NF-based bounded-space online bin packing algorithms
In Zheng et al. (J Comb Optim 30(2):360–369, 2015) modelled a surgery problem by the one-dimensional bin packing, and developed a semi-online algorithm to give an efficient feasible solution. In their algorithm they used a buffer to temporarily store items, having a possibility to lookahead in the l...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2018
|
| Sorozat: | JOURNAL OF COMBINATORIAL OPTIMIZATION
35 No. 2 |
| Tárgyszavak: | |
| doi: | 10.1007/s10878-017-0175-4 |
| mtmt: | 3272000 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/28445 |