Pages that link to "Item:Q1348737"

The following pages link to Polynomial time approximation schemes for class-constrained packing problems (Q1348737):

Displaying 12 items.

• Selfish bin coloring (Q411255) (← links)
• Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
• The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
• Tight bounds for online class-constrained packing (Q596145) (← links)
• Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
• Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
• The constrained compartmentalised knapsack problem (Q868151) (← links)
• Class constrained bin covering (Q970104) (← links)
• Algorithms for storage allocation based on client preferences (Q975763) (← 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)