Number of rectangles of unit width sufficient for packing given rectangles
โ Scribed by V. Yu. Bakenrot; O. B. Makarevich; A. G. Chefranov
- Publisher
- Springer US
- Year
- 1984
- Tongue
- English
- Weight
- 342 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
It is shown that for any positive E the strip-packing problem, i.e. the problem of packing a given list of rectangles into a strip of width 1 and minimum height. can be solled within I c 2: times the optimal height, in linear time, if the heights and widths of these rectangles are all bounded below
This paper proposes an improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Some improvements on the ยฎtness function of genetic algorithm for the orthogonal packing of rectangles are also suggested. Solutions of two numerical examples show the eectiveness of these imp
A sufficient condition is obtained for the stability of a catalyst pellet system with unit Lewis number and general boundary conditions. Specific results for spherical and cylindrical pellets are given. The stability can be determined in a concise manner. The sufficient condition is derived first fo