Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!lll-winken!sun-barr!newstop!exodus!appserv!angel.Eng.Sun.COM!henry
From: henry@angel.Eng.Sun.COM (Henry McGilton)
Newsgroups: comp.text
Subject: Re: 2-dimensional bin packing problem
Summary: Start Here
Keywords: floorplan, VLSI layout
Message-ID: <442@appserv.Eng.Sun.COM>
Date: 18 Feb 91 18:42:27 GMT
References: <1500@ipsi.UUCP> <1991Feb14.005658.23026@zorch.SF-Bay.ORG>
Sender: news@appserv.Eng.Sun.COM
Followup-To: comp.text
Lines: 22

hoch@ipsi.UUCP (Rainer Hoch) writes:

    *  I am interested in the following 2-dimensional bin packing problem:
    *  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.

A good starting point is

    Setting Tables And Illustrations With Style
    by Richard J Beach
    available (I hope) from Xeroc PARC
    3333 Coyote Hill Road
    Palo Alto
    California 94304

	........  Henry