Pages that link to "Item:Q5930158"

The following pages link to On two class-constrained versions of the multiple knapsack problem (Q5930158):

Displaying 21 items.

• 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)
• Almost optimal solutions for bin coloring problems (Q941831) (← links)
• Class constrained bin covering (Q970104) (← links)
• Algorithms for storage allocation based on client preferences (Q975763) (← links)
• Class constrained bin packing revisited (Q986543) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• Permuted function matching (Q1675783) (← links)
• A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
• Offline black and white bin packing (Q2355707) (← links)
• Data migration on parallel disks: Algorithms and evaluation (Q2369881) (← links)
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
• Improved approximation algorithms for data migration (Q2429330) (← links)
• The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
• Resource Allocation Games with Multiple Resource Classes (Q2971166) (← links)
• Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison (Q3541114) (← links)
• A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
• Bin packing with directed stackability conflicts (Q5501519) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)