Pages that link to "Item:Q1306350"
From MaRDI portal
The following pages link to Optimal on-line algorithms for variable-sized bin covering (Q1306350):
Displaying 11 items.
- Selfish bin covering (Q650947) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- Online variable sized covering (Q1854485) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- On the on-line rent-or-buy problem in probabilistic environments (Q2460108) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859) (← links)
- An on-line bin-batching problem. (Q5929317) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
