Pages that link to "Item:Q834190"
From MaRDI portal
The following pages link to Rectangle packing with one-dimensional resource augmentation (Q834190):
Displaying 16 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- Online square-into-square packing (Q521815) (← links)
- Maximizing the total profit of rectangles packed into a rectangle (Q878442) (← links)
- 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)
- Resource augmentation in two-dimensional packing with orthogonal rotations (Q2583714) (← links)
- On packing rectangles with resource augmentation: maximizing the profit (Q2867317) (← links)
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms (Q2905284) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (Q3297564) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)