Pages that link to "Item:Q699764"
From MaRDI portal
The following pages link to Fair versus unrestricted bin packing (Q699764):
Displaying 8 items.
- Online knapsack revisited (Q260271) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Online Bounded Analysis (Q5740182) (← links)