Hello all. I'm working on a fulfillment system that needs to figure out how to pack a box so I can get a shipping estimate from UPS.
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? I found this on CPAN: Algorithm::Bucketizer - Distribute sized items to buckets with limited size http://search.cpan.org/author/MSCHILLI/Algorithm-Bucketizer-0.10/Bucketi zer.pm Using it to get a volumetric approximation, and adding a fudge factor may be good enough. Any thoughts? Joel Gwynn Variable Data Spire 617 832-1957 _______________________________________________ Boston-pm mailing list [EMAIL PROTECTED] http://mail.pm.org/mailman/listinfo/boston-pm
