scientific article; zbMATH DE number 19811
From MaRDI portal
Publication:3979317
[For the entire collection see Zbl 0707.00019.] A rectangle \(T\) with the sides \(A\) and \(B\) and a list \(L\) of rectangles with the sides \(a\) and \(b\) are given. It is necessary to pack the maximal number of rectangles from \(L\) in \(T\) without overlappings where the side \(a\) can be parallel both to \(A\) and to \(B\). An efficient approximate algorithm for solution of the formulated problem is proposed.
Recommendations
- LATIN 2004: Theoretical Informatics
- Packing Rectangles into 2OPT Bins Using Rotations
- scientific article; zbMATH DE number 4198016
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- On strip packing with rotations
- Heuristic for the rectangular strip packing problem with rotation of items
- On packing of rectangles in a rectangle
- Packing rectangles with congruent polyominoes
- Packing a rectangle with m x (m + 1) rectangles
Cited in
(7)- Oriented aligned rectangle packing problem
- Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- scientific article; zbMATH DE number 4091172 (Why is no real title available?)
- scientific article; zbMATH DE number 1262696 (Why is no real title available?)
- Optimal rectangle packing: an absolute placement approach
- Algorithms for the solution of the problem of placing rectangles in a rectangular area
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979317)