Pages that link to "Item:Q3208073"
From MaRDI portal
The following pages link to Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation (Q3208073):
Displayed 8 items.
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Probabilistic analysis of a heuristic for the dual bin packing problem (Q1824388) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
- Performance of Heuristics for a Computer Resource Allocation Problem (Q3313258) (← links)