Pages that link to "Item:Q2272375"
From MaRDI portal
The following pages link to Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375):
Displaying 10 items.
- Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- (Q2980929) (redirect page) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Algorithms for scheduling deadline-sensitive malleable tasks (Q6559486) (← links)
