53 search results - page 1 / 11 » A Construction for Sets of Integers with Distinct Subset Sum... |
COMBINATORICS
1998
13 years 10 months ago
1998
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
ICALP
1998
Springer
14 years 3 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
EOR
2006
13 years 11 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
MP
2010
13 years 9 months ago
2010
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...