AbstractAn algorithm is presented that can be used to pack sets of squares (or rectangles) into rectangles. The algorithm is applied to three open problems and will show how the best known results can be improved by a factor of at least 6×106in the first two problems and 2×106in the third
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
AbstractThe following problem arises in connection with certain multidimensional stock cutting probl...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractAn interesting problem is to determine whether all the squares of side n−1 can be packed int...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
It is known that ∑i=1∞1/i2=π2/6. Meir and Moser asked what is the smallest ϵ such that all the squar...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractIn the rectangle packing problem we are given a set R of rectangles with positive profits an...
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can c...
We consider the problem of determining the smallest square into which a given set of rectangular ite...
We consider the problem of determining the smallest square into which a given set of rectangular ite...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
AbstractThe following problem arises in connection with certain multidimensional stock cutting probl...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractAn interesting problem is to determine whether all the squares of side n−1 can be packed int...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
It is known that ∑i=1∞1/i2=π2/6. Meir and Moser asked what is the smallest ϵ such that all the squar...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractIn the rectangle packing problem we are given a set R of rectangles with positive profits an...
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can c...
We consider the problem of determining the smallest square into which a given set of rectangular ite...
We consider the problem of determining the smallest square into which a given set of rectangular ite...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
AbstractThe following problem arises in connection with certain multidimensional stock cutting probl...
DOI
Add to ORKG