subset-sum

问题 This question already has an answer here : If there is no subset sum equal to a given value, return subset sum closest to the value (1 answer) Closed 3 years ago . This chunk of code is the function that solves a variant of a subset sum problem, but I dont really understand how it gets the answer. The function returns the subset sum that's closest to the value, if its the same as the value then it just return the value, if two subsets sums are equally close to the value then return the

问题 Given a set A of n positive integers a1, a2,... a3 and another positive integer M, I'm going to find a subset of numbers of A whose sum is closest to M. In other words, I'm trying to find a subset A′ of A such that the absolute value |M - 􀀀 Σ a∈A′| is minimized, where [ Σ a∈A′ a ] is the total sum of the numbers of A′. I only need to return the sum of the elements of the solution subset A′ without reporting the actual subset A′. For example, if we have A as {1, 4, 7, 12} and M = 15. Then, the

问题 I have an array of positive integers say {a1, a2, ...., an}, and I want to find out all possible subsets of the array which satisfy the following condition: (sum >= K) where K is a positive integer. I know the solution for this problem is dynamic programming, but unable to think how to use it for this case. Please help. P.S. : I don't exactly need all the subsets, but say product of all elements for all subsets formed. 回答1: Your problem looks similar to 0-1 Knapsack problem, except on thing -

问题 The subset sum problem is the problem to create an algorithm that takes an array and sum and returns all subsets of the argument array whose sum is equal to the given sum. I am attempting to solve a variety of the subset sum problem (using JavaScript) in which only non-negative integers are allowed and where all the subsets whose sum is equal to the passed in sum are returned. I have followed a dynamic programming approach to solving the problem and have created a function that returns a two

问题 I've got a sparse power set for an input (ie some combos have been pre-excluded). Each entry in the power set has a certain score. I want to find the combination that covers all points and maximizes the overall score. For example, let's say the input is generated as follows: function powerset(ary) { var ps = [[]]; for (var i = 0; i < ary.length; i++) { for (var j = 0, len = ps.length; j < len; j++) { ps.push(ps[j].concat(ary[i])); } } return ps; } function generateScores() { var sets =

问题 Does anyone know how to implement the Sum-of-Subsets problem in Java from this pseudo code? w = an array of positive integers sorted in non-decreasing order. W = the target sum value include = an array or arraylist of the solutions who's weight adds up to W. After the print statement, this array can be deleted so that it can store the next solution. weight = weight of elements in the include array. total = weight of the remaining elements not in the include array. public static void sum_of

问题 I have a real-world problem (not homework!) that requires finding the sum of a subset of set A that equals the sum of a subset of some other set B. A very similar question with a helpful answer is here. Consider this example: @a = qw(200 2000 2000 2000 4000); @b = qw(528 565 800 1435 2000 2000 2872); Using the code provided in the accepted answer to that question, I get the following output: sum(200 2000 4000) = sum(528 800 2000 2872) sum(200 4000 4000) = sum(528 800 2000 2000 2872) sum(200

问题 I have an array with some integer values, and I need to get a subset of them that gives me the maximum sum that is inferior to a given value. So let's say I have this array: [40, 138, 29, 450] I would like to get a subset of this array that maximize the sum but is inferior to a limit given by the user, let's say 250. In this case it should return [139, 40, 29]. I had a look at this question and related answer, and tried to use the code given, but I didn't understand it very well. Anyway I've

问题 I am trying to build upon a problem, to solve another similar problem... given below is a code for finding the total number of subsets that sum to a particular value, and I am trying to modify the code so that I can return all subsets that sum to that value (instead of finding the count). Code for finding the total number of suibsets that sum to 'sum': /** * method to return number of sets with a given sum. **/ public static int count = 0; public static void countSubsetSum2(int arr[], int k,

问题 I have a collection of N positive integers, each bounded by a (relatively small) constant C. I want to find a subset of these numbers with the smallest sum greater than (or equal to) a value K. The numbers involved aren't terribly large (<100), but I need good performance even in the worst case. I thought maybe I could adapt Pisinger's dynamic programming algorithm to the task; it runs in O(NC) time, and I happen to meet the requirements of bounded, positive numbers. [Edit]: The numbers are