What are you trying to optimize?
Neither. It's one of
Efficiently fill drives of fixed size? The latter is (as AppleFritter points out) the knapsack problem.
No, it's not, as I already pointed out. In the knapsack problem, you have one bin (tape), and you're trying the maximize what you can put on it. Stuff is left behind.
In reply to Re^2: Computer science Problem - single dimension bin packing
by ikegami
in thread Computer science Problem - single dimension bin packing
by davis
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |