Two-dimensional bin packing: Innovations and statistical analysis.

In this thesis, we introduce and analyze a new two dimensional bin packing algorithm. We focus on the problem of packing rectangles with known dimensions into a fixed width, infinite height bin so as to minimize the total height of the packing. To analyze the algorithm we use statistical methods to compare the known optimal pack heights with the pack heights obtained by the algorithm on a set of randomly generated test problems. This gives us a general technique to not only analyze a single algorithm, but also one which may be used to compare existing algorithms. The method to generate test problems is another contribution of this thesis.Dept. of Economics, Mathematics, and Statistics. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1997 .B72. Source: Masters Abstracts International, Volume: 37-01, page: 0271. Adviser: Richard Caron. Thesis (M.Sc.)--University of Windsor (Canada), 1997