Pages that link to "Item:Q6090894"
From MaRDI portal
The following pages link to Approximation Algorithms for Demand Strip Packing (Q6090894):
Displaying 4 items.
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)