No label defined (Q3979317)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 19811
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 19811

      Statements

      0 references
      0 references
      26 June 1992
      0 references
      packing
      0 references
      rectangle
      0 references
      approximate algorithm
      0 references
      [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.
      0 references

      Identifiers