Low Density Subset Sum Problem Solver

This application solves the low density subset sum problem. The subset problem can be stated succinctly as "given a set of positive integers called a knapsack set and a positive integer s, determine whether there is a subset of the knapsack set that sums to s."- A. Menezes et al.

C# (105.3 KB)
156 times
Add to favorites
E-mail Twitter del.icio.us Digg Facebook

Solution explorer

Click an item in the panel on the left to view the contents here.