Pages that link to "Item:Q1100914"
From MaRDI portal
The following pages link to Bin packing with divisible item sizes (Q1100914):
Displaying 30 items.
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- ATM VP-based network design (Q596263) (← links)
- Optimal packet-to-slot assignment in mobile telecommunications (Q833596) (← 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)
- Optimal energy-efficient placement of virtual machines with divisible sizes (Q1653041) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← 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)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE (Q5249256) (← links)
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
- Scheduling games with rank-based utilities (Q6160122) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
