Robert Klemme wrote:

> There are algorithms but they are in NP, i.e. they perform worse than 
> polynomial.  In your case (20 - 30) they might still yield acceptable 
> runtime (compared to the time needed to burn the DVD).
> 
> IIRC another approach to solve this are genetic algorithms.
> 

Ant colony systems can also be considered (they are more convergent and 
less susceptible to local optimas at the same time).
There are also deterministic approximate algorithms for the knapsack 
problem.


lopex