The following pages link to On the online bin packing problem (Q3455545):
Displayed 24 items.
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- A note on online hypercube packing (Q623793) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- Online square and cube packing (Q2570973) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- On online bin packing with LIB constraints (Q3655570) (← links)