Pages that link to "Item:Q5443386"
From MaRDI portal
The following pages link to Approximation Schemes for Packing Splittable Items with Cardinality Constraints (Q5443386):
Displaying 7 items.
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- Scheduling with Interjob Communication on Parallel Processors (Q2958346) (← links)
- On Packing Splittable Items with Cardinality Constraints (Q3163876) (← links)