Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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.


Comment on Re^2: Challenge: Twist On Bin Packing

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://541885]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (8)
As of 2015-07-07 23:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (93 votes), past polls