Pages that link to "Item:Q2428665"
From MaRDI portal
The following pages link to Approximation schemes for packing splittable items with cardinality constraints (Q2428665):
Displayed 11 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
- Scheduling with Interjob Communication on Parallel Processors (Q2958346) (← links)
- (Q5089171) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)