Don wrote:
> Chung Leong wrote:
>
> > Isn't that an NP-complete problem or am I crazy?
>
> It is NP complete. Its known as the "cutting stock problem" (aka "Knapsack
> problem"). Here's a Wikipedia page that describes it:
>
> http://en.wikipedia.org/wiki/Cutting_stock_problem
>
> There are commeric
On Friday 01 July 2005 06:25 pm, Brian van den Broek wrote:
> All in all, I wish I'd not hit send in the first place. This is
> perilously close to sending me into fits ;-)
Well, I thought it was funny, anyway. Of course, not when you
have to explain it. ;-)
I guess you just have to have a stro
Robert Kern said unto the world upon 01/07/2005 17:24:
> Brian van den Broek wrote:
>
>
>>Well, I found it ironic, but only when you add that the genetic
>>algorithm approach came up in the context of a "best fit" problem.
>>Survival of the fittest indeed :-)
>
>
> Optimization codes don't al
Brian van den Broek wrote:
> Well, I found it ironic, but only when you add that the genetic
> algorithm approach came up in the context of a "best fit" problem.
> Survival of the fittest indeed :-)
Optimization codes don't always succeed. What's the irony?
--
Robert Kern
[EMAIL PROTECTED]
"
Peter Hansen said unto the world upon 01/07/2005 11:47:
> Dan Sommers wrote:
>
>>Peter Hansen <[EMAIL PROTECTED]> wrote:
>>
>>>This problem is well suited to the abilities of genetic algorithms,
>>>and this would probably be an excellent way to learn more about them,
>>>even if you don't get the b
Dan Sommers wrote:
> Peter Hansen <[EMAIL PROTECTED]> wrote:
>>This problem is well suited to the abilities of genetic algorithms,
>>and this would probably be an excellent way to learn more about them,
>>even if you don't get the best solution.
>
> There's some sort of irony or something in there
Dan Sommers <[EMAIL PROTECTED]> writes:
> There's some sort of irony or something in there about not writing the
> best genetic algorithm, but I can't quite put my finger on it.
+1 QOTW :)
--
# Edvard Majakari Software Engineer
# PGP PUBLIC KEY available Soli Deo Gloria!
$_
On Thu, 30 Jun 2005 13:09:02 -0400,
Peter Hansen <[EMAIL PROTECTED]> wrote:
> This problem is well suited to the abilities of genetic algorithms,
> and this would probably be an excellent way to learn more about them,
> even if you don't get the best solution.
There's some sort of irony or someth
Don wrote:
> I was thinking maybe you could use a genetic algorithm, where the fitness
> function would caluclate the amount of waste. I'm not very familar with how
> to implement this sort of thing, though.
This problem is well suited to the abilities of genetic algorithms, and
this would probab
[EMAIL PROTECTED] wrote:
>
>
> Chung Leong wrote:
>> Isn't that an NP-complete problem or am I crazy?
>
> That makes it a more realistic challange, doesn't it?
>
> Suppose it was something simple, like calculating a
> minimal spanning tree. Every program would produce the
> same output. What k
On Wed, 29 Jun 2005 19:43:33 -0400,
Roy Smith <[EMAIL PROTECTED]> wrote:
> Not just plywood panels, but sheets of paper, bolts of cloth, sheet
> metal, plate glass, etc. A slight complication is that some materials
> have a preferred orientation (i.e. plywood has a grain, textiles have
> warp vs.
In article <[EMAIL PROTECTED]>,
Don <[EMAIL PROTECTED]> wrote:
> Chung Leong wrote:
>
> > Isn't that an NP-complete problem or am I crazy?
>
> It is NP complete. Its known as the "cutting stock problem" (aka "Knapsack
> problem"). Here's a Wikipedia page that describes it:
>
> http://en.wikipe
Don wrote:
> Chung Leong wrote:
>
> > Isn't that an NP-complete problem or am I crazy?
>
> It is NP complete. Its known as the "cutting stock problem" (aka "Knapsack
> problem"). Here's a Wikipedia page that describes it:
>
> http://en.wikipedia.org/wiki/Cutting_stock_problem
>
> There are commer
Chung Leong wrote:
> Isn't that an NP-complete problem or am I crazy?
It is NP complete. Its known as the "cutting stock problem" (aka "Knapsack
problem"). Here's a Wikipedia page that describes it:
http://en.wikipedia.org/wiki/Cutting_stock_problem
There are commerical applications available t
Chung Leong wrote:
> Isn't that an NP-complete problem or am I crazy?
That makes it a more realistic challange, doesn't it?
Suppose it was something simple, like calculating a
minimal spanning tree. Every program would produce the
same output. What kind of contest would that be?
--
http://mai
Isn't that an NP-complete problem or am I crazy?
--
http://mail.python.org/mailman/listinfo/python-list
GLOSSY: The Summer Programmer Of The Month Contest is underway!
Deadline is September 30, 2005
http://dinsights.com/POTM
I love taking digital pictures, but that nice glossy photo paper
is expensive! So when my lovel
17 matches
Mail list logo
