An approximation scheme for strip packing of rectangles with bounded dimensions
From MaRDI portal
Recommendations
Cites work
- A algorithm for two-dimensional packing
- Bin packing can be solved within 1+epsilon in linear time
- Integer Programming with a Fixed Number of Variables
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- The NP-completeness column: An ongoing guide
- Time bounds for selection
Cited in
(19)- On approximating strip packing with a better ratio than 3/2
- scientific article; zbMATH DE number 3942360 (Why is no real title available?)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A \((5/3+\varepsilon)\)-approximation for strip packing
- An approximation algorithm for sequential rectangle placement
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An exact method for the 2D guillotine strip packing problem
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- Strip packing with precedence constraints and strip packing with release times
- Approximate strip packing: revisited
- Models of the nonguillotine sheet and strip rectangular packing problem
- Two-dimensional packing problems: a survey
- A near-optimal solution to a two-dimensional cutting stock problem
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Parameterized complexity of strip packing and minimum volume packing
- High multiplicity strip packing with three rectangle types
- The two-dimensional cutting stock problem revisited
- scientific article; zbMATH DE number 3904609 (Why is no real title available?)
This page was built for publication: An approximation scheme for strip packing of rectangles with bounded dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383370)
