A Tailor's Problem

Article View: sci.math.num-analysis

Article #398

Back to sci.math.num-analysis Previous Next

#398

From: chr09tk
Date: Tue, 01 Sep 1992 17:07

11 lines
749 bytes

Hello!

I would be grateful for any refferences concerning the following problem:

We are given a roll of cloth of a given width and unlimited length. We are also
given a finite set of polygons (pieces of clothing). We want to cut out the
polygons using a minimal length of the cloth. Devise an algorithm that will get
us as close as possible to the minimum (within reasonable time). 

Thanks in advance,
Haggai Katriel

Technical Details

Message-ID: <1992Sep1.190730.1@vmsa.technion.ac.il>

Path: arc1-ca.pugleaf.net!sparky!uunet!olivea!bu.edu!wang!news

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!olivea!bu.edu!wang!news
From: chr09tk@vmsa.technion.ac.il
Newsgroups: sci.math.num-analysis
Subject: A Tailor's Problem
Message-ID: <1992Sep1.190730.1@vmsa.technion.ac.il>
Date: 1 Sep 92 17:07:30 GMT
Sender: news@wang.com
Organization: Technion, Israel Institute of Technology
Lines: 11