Oriented aligned rectangle packing problem
From MaRDI portal
Recommendations
Cites work
- A algorithm for two-dimensional packing
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3808965 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- Lower bounds for on-line two-dimensional packing algorithms
- On packing squares with equal squares
- On Packing Two-Dimensional Bins
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(5)- Local search algorithms for the rectangle packing problem with general spatial costs
- Ordered strip packing
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Applying genetic algorithms and neural networks to the container loading problem
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
This page was built for publication: Oriented aligned rectangle packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196022)