Xref: utzoo sci.math:15052 comp.theory:1529 comp.text.sgml:179 comp.text.tex:5370 comp.text:8004
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!hellgate.utah.edu!caen!sdd.hp.com!spool.mu.edu!uunet!mcsun!unido!ipsi!hoch
From: hoch@ipsi.UUCP (Rainer Hoch)
Newsgroups: sci.math,comp.theory,comp.text.sgml,comp.text.tex,comp.text
Subject: 2-dimensional bin packing problem
Keywords: floorplan, VLSI layout
Message-ID: <1500@ipsi.UUCP>
Date: 12 Feb 91 15:54:55 GMT
Lines: 23

I am interested in the following 2-dimensional bin packing  prob-
lem:

The problem requires to pack n rectangular items into  a  minimal
number  of rectangular unit capacity bins. I am interested in the
case when the length and the width  of  the  items  are  not  too
weird.  In  fact I can assume that the ratio of the length (resp.
															width) of
the unit and the length (resp. width)  of  an  item  is
equal to 1,2,3,4 or 5 (i.e. it is integral).

A possible application would be the problem of how to place n ar-
ticles on a minimal number of pages in a newspaper.

Any hints, solutions or pointers to algorithms in  the literature
are welcome.

Thanks Volker Turau

Adress:  e-mail hoch@darmstadt.gmd.dbp.de   or
                turau@darmstadt.gmd.dbp.de
        ean-address: s=hoch;ou=darmstadt;p=gmd;a=dbp;c=de or
                     s=turau;ou=darmstadt;p=gmd;a=dbp;c=de