[1] |
Aristova, I. V.: Solution method of placement rectangle problem taking into account minimal admissible distances. Mathematical modelling and optimization system of technical systems and processes, 30-33 (1993) |

[2] |
Baker, B. S.; Brown, D. J.; Katself, H. P.: Orthogonal packing in two dimensions. SIAM journal on computing 9, No. 4, 846-855 (1980) |

[3] |
Beasly, J. E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operational research 33, 49-65 (1985) |

[4] |
Correia, M. H.; Oliveira, J. F.; Ferreira, J. S.: Cylinder packing by simulated annealing. Pesquisa operacional 20, No. 2, 269-286 (2000) · Zbl 1181.90231 |

[5] |
Garey, M. R.; Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness. (1979) · Zbl 0411.68039 |

[6] |
George, J. A.; George, J. M.; Lamar, B. W.: Packing different-sized circles into a rectangular container. European journal of operational research 84, 693-712 (1995) · Zbl 0928.90077 |

[7] |
Gill, P. E.; Murray, W.; Wright, M. H.: Practical optimization. (1981) · Zbl 0503.90062 |

[8] |
G.S. Guter, Optimization by method of partial improvement by groups of variables, in: Mathematical Methods Solving Economical Problems, Moscow, 1969, pp. 21--38 (in Russian) |

[9] |
Huang, W. Q.; Zhan, S. H.: A quasi-physical method of solving packing problems. Acta mathematicae applicatae sinica 2, No. 2, 176-180 (1979) |

[10] |
E.A. Mukhacheva, L.I. Sheltman, Decomposition method of two- and-three-dimensional rectangular bin packing, in: Decision Making under Conditions of Uncertainty (Cutting-Packing Problems), Ufa., 1997, pp. 155--172 |

[11] |
Papadimitrov, C. H.; Steiglitz, K.: Combinatorial optimization: algorithms and complexity. (1982) · Zbl 0503.90060 |

[12] |
L.D. Ponomarenko, P.M. Makmak, New approaches to minimization on permutations when packing geometric objects, in: Theory and Methods of Automated Design, 4, Inst. for Technical Cybernetics, Ac. Sci. BSSR, Minsk, 1980, pp. 8--14 (in Russian) |

[13] |
V.L. Rvachev, Yu.G. Stoyan, At problem on optimal placement of circle blanks, Part I, Cybernetics, Kiev, N3, 1965, pp. 77--83 (in Russian) |

[14] |
V.L. Rvachev, Yu.G. Stoyan, At problem on optimal placement of circle blanks, Part II, Cybernetics, Kiev, N4, 1965, pp. 70--75 (in Russian) |

[15] |
V.G. Shmigol’, Software of Local Optimization of Geometric Design Problems, Thesis, Institute for Problems in Machinery of Ac. Sci. of USSR, Institute of Radioelectronics, Kharkov, 1991, p. 16 (in Russian) |

[16] |
Stoyan, Yu.G.; Cherepakhin, V. M.: On rational placement of geometric objects. Controlled systems 4,5 (1970) |

[17] |
Stoyan, Yu.G.: Placement of geometric objects. (1975) |

[18] |
Stoyan, Yu.G.; Gil’, N. I.: Methods and algorithms of placement of planar geometric objects. (1976) |

[19] |
Stoyan, Yu.G.: Mathematical methods for geometric design. Advances in CAD/Cam: proceeding PROLAMAT82, leningrad, USSR, 16--18 May 1982, 67-86 (1983) |

[20] |
Stoyan, Yu.G.; Yakovlev, S. V.: Mathematical models and optimization methods of geometric design. (1988) |

[21] |
Yu.G. Stoyan, I.V. Aristova, G.N. Yas’kov, Adaptation of branch and bound method to solve problem of rectangle optimal placement taking into account minimal and maximal admissible distances, Preprint 384, Institute for Problems in Machinery of National Ukrainian Academy of Sciences, Kharkov, 1995 (in Russian) |

[22] |
Stoyan, Yu.G.; Yas’kov, G. N.: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International transactions in operational research 5, No. 1, 45-57 (1998) · Zbl 0910.90240 |

[23] |
Taha, H. A.: Integer programming. Theory. applications and computations. (1975) · Zbl 0316.90042 |

[24] |
Yas’kov, G. N.: Solution method of problem of circle placement. Mathematical and computational modelling for machinery, 91-93 (1994) |