| Article ID: | iaor1992462 |
| Country: | Germany |
| Volume: | 27 |
| Start Page Number: | 283 |
| End Page Number: | 288 |
| Publication Date: | Oct 1991 |
| Journal: | Elektronische Informationsverarbeitung und Kybernetik |
| Authors: | Br G. |
S.L. Hakimi has studied the problem of packing rectangles with given areas and prescribed ranges for their aspect ratios into a rectangle of least area. It has been shown that the problem is NP-complete whereas some special cases are solvable in polynomial time. This paper generalizes the special cases which are solvable in polynomial time.