Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by ikegami (Pope)
on Aug 14, 2014 at 19:18 UTC ( #1097479=note: print w/ replies, xml ) Need Help??


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

Then add another bin (tape) and start filling it with leftovers. Repeat until no more bins (tapes) or leftovers.

That wouldn't optimize anything. I think we all agree that there is something that he wants to optimize.


Comment on Re^4: Computer science Problem - single dimension bin packing
Re^5: Computer science Problem - single dimension bin packing
by FloydATC (Chaplain) on Aug 14, 2014 at 20:13 UTC
    That wouldn't optimize anything

    What I mean is, it's still a knapsack problem but there are fewer items with each iteration. In pseudocode:

    my @items = qw( loads of variable size items here ); while (@items) { push @tapes, remove_from(\@items); } sub remove_from { my $arrayref = shift; my $taperef = []; # Knapsack algorithm goes here # ... # Whatever we put in $taperef is removed from $arrayref # ... return $taperef; }

    How would this not optimize for number of tapes?

    -- FloydATC

    Time flies when you don't know what you're doing

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (10)
As of 2014-10-24 08:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (131 votes), past polls