The following pages link to Dynamic Bin Packing (Q3657446):
Displaying 31 items.
- Models for video-on-demand scheduling with costs (Q286685) (← links)
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- A dynamic storage process (Q751479) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← 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)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation (Q2867105) (← links)
- On some packing problem related to dynamic storage allocation (Q3830539) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap (Q5084484) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
- Renting servers in the cloud: the case of equal duration jobs (Q6657265) (← links)
