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.











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)