Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^3: Computer science Problem - single dimension bin packing

by AppleFritter (Curate)
on Aug 14, 2014 at 16:19 UTC ( #1097443=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Computer science Problem - single dimension bin packing
in thread Computer science Problem - single dimension bin packing

The Wikipedia article has a section on that:

Multiple knapsack problem

This variation is similar to the Bin Packing Problem. It differs from the Bin Packing Problem in that a subset of items can be selected, whereas, in the Bin Packing Problem, all items have to be packed to certain bins. The concept is that there are multiple knapsacks. This may seem like a trivial change, but it is not equivalent to adding to the capacity of the initial knapsack. This variation is used in many loading and scheduling problems in Operations Research and has a PTAS.

I'm afraid I'm not familiar with this variation, but having a name to search for should help, I reckon.


Comment on Re^3: Computer science Problem - single dimension bin packing
Re^4: Computer science Problem - single dimension bin packing
by ikegami (Pope) on Aug 14, 2014 at 17:11 UTC
    The OP surely wants to store the entire directory on his tapes. If so, MKP won't help. MKP is for when you have a fixed number of bins and stuff might not fit in the bins.
      You're likely right. Thanks for enlightening me, brother!

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (14)
As of 2014-12-18 08:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (47 votes), past polls