|Perl: the Markov chain saw|
Bin packing problem variation repost (see)by BrowserUk (Pope)
|on Apr 14, 2010 at 14:35 UTC||Need Help??|
BrowserUk has asked for the
wisdom of the Perl Monks concerning the following question:
gskoli posted Help Me in following code ::, but the question wasn't very clear due to english not being his first language. And with the posted code being rather long, it didn't receive much attention. We've now clarified what he needs, and I'm posting this on his behalf to try and get him an answer.
He has the following array of values:
And he wishes to pack them into groups of 6, (or 5 or 4 at a pinch), such that each group totals to between 840 and 900 inclusive.
Can any of you CS guys offer him a solution? Canned or otherwise.
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.