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:)
In reply to Re: Re: Re: help with nesting
by BrowserUk
in thread help with nesting
by stu96art
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |