Universal container for packing rectangles
Colloquium Mathematicum, Tome 92 (2002) no. 2, pp. 155-160
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
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.
Keywords:
the paper rectangle least area which each sequence rectangles sides greater total area packed
Affiliations des auteurs :
Janusz Januszewski  1
@article{10_4064_cm92_2_1,
author = {Janusz Januszewski},
title = {Universal container for packing rectangles},
journal = {Colloquium Mathematicum},
pages = {155--160},
year = {2002},
volume = {92},
number = {2},
doi = {10.4064/cm92-2-1},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/cm92-2-1/}
}
Janusz Januszewski. Universal container for packing rectangles. Colloquium Mathematicum, Tome 92 (2002) no. 2, pp. 155-160. doi: 10.4064/cm92-2-1
Cité par Sources :