Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Saturday, August 13, 2011
Knapsack
You have n types of items, where the ithitem type has an integer size siand a real value vi. You need to fill a knapsack of total capacity C with a selection of items of maximum value.
I love the NP complete problems... In my life I understood that the optimum is unreachable, and sometimes "strike a balance" between efforts and results is the all the best we can do! ...The good old Metropolis algorithm follows exactly this principle and so I love it!. http://textanddatamining.blogspot.com/
I love the NP complete problems...
ReplyDeleteIn my life I understood that the optimum is unreachable, and sometimes "strike a balance" between efforts and results is the all the best we can do!
...The good old Metropolis algorithm follows exactly this principle and so I love it!.
http://textanddatamining.blogspot.com/