Pages that link to "Item:Q596145"
From MaRDI portal
The following pages link to Tight bounds for online class-constrained packing (Q596145):
Displayed 8 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)
- 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)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)