In this Java project several different solutions of the NP-complete knapsack problem are illustrated. It comes with a framework to measure the time of the different algorthms and compare their solutions.
More information about the problem: https://en.wikipedia.org/wiki/Knapsack_problem