I think that euzeka is right about the bin packing problem being np-complete. You can still use heuristics, though. Give this a try:<BR><BR> 1. Add tracks until a casette side is at least 1/3 full ...

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for ...