Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
Re: Help with attempting to solve cutting stock problem (knapsack)by Abigail-II (Bishop) |
on Jan 16, 2004 at 16:29 UTC ( [id://321818]=note: print w/replies, xml ) | Need Help?? |
The knapsack problem is a well-known problem from the
literature. It's also known to be NP-complete, which means
that there is no known efficient solution.
If you really must solve this, and it should be done fast, do a literature study, and implement one of the faster algorithms you'll see. In C. Abigail
In Section
Seekers of Perl Wisdom
|
|