Packing Rectangles into 2OPT Bins Using Rotations
From MaRDI portal
Publication:3512468
Recommendations
Cites work
- A 3-approximation algorithm for two-dimensional bin packing
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A near-optimal solution to a two-dimensional cutting stock problem
- An approximation algorithm for square packing.
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- Maximizing the total profit of rectangles packed into a rectangle
- New Approximability Results for 2-Dimensional Packing Problems
- On packing of squares and cubes
- On strip packing with rotations
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
Cited in
(9)- Two for One: Tight Approximation of 2D Bin Packing
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Resource augmentation in two-dimensional packing with orthogonal rotations
- scientific article; zbMATH DE number 19811 (Why is no real title available?)
- Absolute approximation ratios for packing rectangles into bins
- Optimal rectangle packing: an absolute placement approach
- Approximation and online algorithms for multidimensional bin packing: a survey
- On two dimensional packing
- Prices of anarchy of selfish 2D bin packing games
This page was built for publication: Packing Rectangles into 2OPT Bins Using Rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512468)