Pages that link to "Item:Q3200540"
From MaRDI portal
The following pages link to Analysis of a Compound Bin Packing Algorithm (Q3200540):
Displaying 15 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Resource allocation under limited sharing (Q750312) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- Deep performance analysis of refined harmonic bin packing algorithm (Q1613251) (← links)
- Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
- Analysis of a Hybrid Algorithm for Packing Unequal Bins (Q3777479) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- Linear compound algorithms for the partitioning problem (Q4526868) (← links)