Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: Challenge: Twist On Bin Packing

by bibliophile (Parson)
on Apr 07, 2006 at 15:25 UTC ( #541885=note: print w/replies, xml ) Need Help??

in reply to Re: Challenge: Twist On Bin Packing
in thread Challenge: Twist On Bin Packing

Hmm. I would have taken a different tactic...

Assume that you have an infinite number of standard containers with a given length/width/height. You also have a finite number of items to go in the containers, each item having its own l/w/h (which can be different for each item). The trick then would be to pack items in containers such that each container can hold no more items... but optimizing for empty space.
Order of packing then becomes the issue.

Actual code is left as an exersise for the reader. :-)

-- WARNING: You are logged into reality as root.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://541885]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2017-11-21 03:30 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (295 votes). Check out past polls.