After some research, I've found that I've stumbled onto a fairly sophisticated NP-Complete math problem called the "Knapsack Problem", which is way over my head.
Given that any particular order is going to be fairly small, ie < 10 pieces, and the variety of container is fairly small ( < 3), and all I really need is an estimate, what's the best way to attack this?
For such a small amount of data, I'd use brute force and try every single variation.
-- David Cantrell | http://www.cantrell.org.uk/david
One person can change the world, but most of the time they shouldn't
-- Marge Simpson_______________________________________________ Boston-pm mailing list [EMAIL PROTECTED] http://mail.pm.org/mailman/listinfo/boston-pm
