id: 04091172
dt: j
an: 04091172
au: Zinchenko, A.B.
ti: A finite algorithm for packing rectangles into a rectangle.
so: Izv. Sev.-Kavk. Nauchn. Tsentra Vyssh. Shk., Estestv. Nauki 1988, No.2(62),
    54-59 (1988).
py: 1988
pu: Izdatel’stvo Rostovskogo Universiteta, Rostov-na-Donu
la: RU
cc: 
ut: tree-search; packing rectangles into a rectangle; polynomial algorithm;
    location
ci: 
li: 
ab: A tree-search procedure for the solution of the problem of packing
    rectangles into a rectangle with given sizes and fixed orientation in a
    compact way is described. A polynomial algorithm is worked out to to
    solve the relaxed problems which lead to a location problem of a single
    rectangle in the complex space. The information obtained as the result
    of the solution of the relaxed problems gives the possibility to
    eliminate the addition of the given partial plan as well as the
    preceding ons. Results of calculations on examples taken from the
    literature are given.
rv: A.B.Zinchenko