Find a subset from a set of integer whose sum is closest to a value
As the title said, Find a subset from a set of integer whose sum is
closest to a value. The set is about 1000 items in it, the value is about
10 million, I have considered using the DP(Dynamic Programming) to solve
this problem, just as the "Bin Packing Problem", But this method is not
suitable, the set is too large and the value is too large.
What can i do, trying Heuristic Algorithm? But How and use Which?
No comments:
Post a Comment