Pages that link to "Item:Q596145"
From MaRDI portal
The following pages link to Tight bounds for online class-constrained packing (Q596145):
Displayed 13 items.
- Selfish bin coloring (Q411255) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Class constrained bin covering (Q970104) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- Resource Allocation Games with Multiple Resource Classes (Q2971166) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
- Bin packing with directed stackability conflicts (Q5501519) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)