Pages that link to "Item:Q5930158"
From MaRDI portal
The following pages link to On two class-constrained versions of the multiple knapsack problem (Q5930158):
Displaying 11 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)
