Pages that link to "Item:Q322552"
From MaRDI portal
The following pages link to A new lower bound for online strip packing (Q322552):
Displaying 11 items.
- A note on online strip packing (Q1029271) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- A lower bound for online rectangle packing (Q2331592) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- Improved Lower Bound for Online Strip Packing (Q2896391) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)