Pages that link to "Item:Q1100914"
From MaRDI portal
The following pages link to Bin packing with divisible item sizes (Q1100914):
Displayed 14 items.
- ATM VP-based network design (Q596263) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- The complexity of multidimensional periodic scheduling (Q1281399) (← links)
- Divisors of codes of Reed-Muller type (Q1332412) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)