Universal container for packing rectangles
Janusz Januszewski
Colloquium Mathematicae, Tome 91 (2002), p. 155-160 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.

Publié le : 2002-01-01
EUDML-ID : urn:eudml:doc:283915 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-cm92-2-1,
     author = {Janusz Januszewski},
     title = {Universal container for packing rectangles},
     journal = {Colloquium Mathematicae},
     volume = {91},
     year = {2002},
     pages = {155-160},
     zbl = {1006.52009},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm92-2-1}
}

Janusz Januszewski. Universal container for packing rectangles. Colloquium Mathematicae, Tome 91 (2002) pp. 155-160. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm92-2-1/