The following pages link to On the online bin packing problem (Q3455545):
Displaying 50 items.
- Online bin packing with advice (Q261387) (← links)
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Online square packing with gravity (Q476449) (← links)
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- A note on online hypercube packing (Q623793) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← 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)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Tight bounds for NF-based bounded-space online bin packing algorithms (Q1702819) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- On the on-line maintenance scheduling problem (Q1744635) (← links)
- More on batched bin packing (Q1785762) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
- Online bin packing with \((1,1)\) and \((2,R)\) bins (Q2355985) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Batched bin packing revisited (Q2398649) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
