Pages that link to "Item:Q2481969"
From MaRDI portal
The following pages link to The class constrained bin packing problem with applications to video-on-demand (Q2481969):
Displaying 15 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Selfish bin coloring (Q411255) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- VNS matheuristic for a bin packing problem with a color constraint (Q1687630) (← links)
- Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING (Q2997921) (← 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)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
