home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!munnari.oz.au!spool.mu.edu!news.cs.indiana.edu!arizona.edu!arizona.edu!news
- From: zep@spider.aml.arizona.edu (Venkatesh Iyer)
- Newsgroups: comp.theory
- Subject: Help Wanted on Packing Problem
- Message-ID: <1992Jul22.161534.3527@arizona.edu>
- Date: 22 Jul 92 23:15:32 GMT
- Article-I.D.: arizona.1992Jul22.161534.3527
- Distribution: world,local
- Organization: University of Arizona, Tucson, AZ
- Lines: 24
- Nntp-Posting-Host: spider.ame.arizona.edu
-
- I am a Grad Student in Mech Engr. at the U of AZ.
-
- I'd like help on the following problem:
-
- I have N (about 200) rectangles (length Ai, width Bi).
-
- I have n "pages" (L x H each) on which I must place these.
-
- I want "n" to be as small as possible.
-
- Variables: Ai, Bi, n
-
- Constants: N, L, H
-
- * Spaces left over on various pages don't matter, and neither
- does orientation of the rectangles (Bi x Ai is fine).
- * AiBi < LH for all i.
- *******
-
- Any and all help is sincerely appreciated. Please reply by e-mail:
-
- zep@spider.ame.arizona.edu
- or
- IYER@CCIT.Arizona.edu
-