Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!uhog.mit.edu!europa.eng.gtefsd.com!howland.reston.ans.net!ix.netcom.com!netcom.com!hbaker
From: hbaker@netcom.com (Henry G. Baker)
Subject: Re: Info on cutting stock problem.
Message-ID: <hbakerD025oH.F2w@netcom.com>
Organization: nil
References: <Czu0w9.LG3@UQuebec.CA>
Date: Wed, 30 Nov 1994 02:02:40 GMT
Lines: 15

In article <Czu0w9.LG3@UQuebec.CA> Marc Dionne <Marc_Dionne@uqtr.uquebec.ca> writes:
>I have to write a program who will resolve cutting stock problem.  I
>need to be able to solve one dimension and two dimensions problem.
>Does somebody can say me where I can find the best documentation on
>this kind of problem?

Gomery, of IBM, wrote a number of important papers on this problem in
the early 1960's (??).

Henry Baker
Read (192.100.81.1) ftp.netcom.com:/pub/hb/hbaker/README for ftp-able papers.
WWW archive: ftp://ftp.netcom.com/pub/hb/hbaker/home.html
************* Note change of address ^^^        ^^^^


