News for hackers. Stuff that matters.
Re:Knapsack problem by hackerboos on Tuesday April 23, 2013 @11:15AM (#5595623)
I studied if for my university dissertation.

It's easy to think of practical applications, example - I have a folder of videos/mp3s etc and I want to fit them on a few DVD-Rs. This algorithm can calculate the most efficient way of getting the most data on the disk without splitting files.

Re:Knapsack problem by ambrop7 on Tuesday April 23, 2013 @01:14PM (#5596458)
I think that this would be an instance of the bin packing problem, not the knapsack problem ( http://en.wikipedia.org/wiki/Bin_packing_problem ). (yes, the knapsack problem wikipedia page lists the bin packing problem as a generalization)
Re:Knapsack problem by adamgray on Tuesday April 23, 2013 @01:54PM (#5596768)
Me too! I compared general purpose GPU libraries versus performance on a Beowulf cluster and OpenMP / UPC. Was a lot of fun and an interesting experience.
Re:Knapsack problem by praptak on Tuesday April 23, 2013 @12:42PM (#5596209)
Fun fact: some CD players could optimize the CD->audio cassette packing.