in reply to Re: Re: help with nesting
in thread help with nesting

According to NIST, the Cutting Stock Problem is NP-Complete.

The are several agressive optimisations that can be applied, but the basic status of the problem remains...unless you know different:)

Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"When I'm working on a problem, I never think about beauty. I think only how to solve the problem. But when I have finished, if the solution is not beautiful, I know it is wrong." -Richard Buckminster Fuller
If I understand your problem, I can solve it! Of course, the same can be said for you.

Replies are listed 'Best First'.
Re4: help with nesting
by dragonchild (Archbishop) on Oct 01, 2003 at 16:30 UTC
    This is very similar to analyzing alpha-beta trees using Treemaps. That problem isn't NP-complete. It's just annoying. :-)

    ------
    We are the carpenters and bricklayers of the Information Age.

    The idea is a little like C++ templates, except not quite so brain-meltingly complicated. -- TheDamian, Exegesis 6

    Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.

[reply]

In Section Seekers of Perl Wisdom