1
$\begingroup$

Given two sets of nonnegative integer numbers:

$X = {x_1, x_2, ... x_n}$ $Y = {y_1, y_2, ... y_m}$

Need to find partition of $X$ on $m$ disjoint subsets, such as sum of elements in $i$-th subset equal to $y_i$.

This generalization of Subset sum problem, which is known to be NP-Complete. One of the probable way of solving is to reduce it to system of integer linear equalities. But it's even more general and really hard to solve task. May be one has some fresh ideas?

Improve this question
$\endgroup$
3
  • $\begingroup$ You might synchronize your indices. Gerhard "Ask Me About System Design" Paseman, 2012.03.28 $\endgroup$
    – Gerhard Paseman
    Commented Mar 28, 2012 at 20:55
  • $\begingroup$ you may want to post this on cs.stackexchange.com $\endgroup$
    – Kaveh
    Commented Apr 18, 2012 at 3:42
  • $\begingroup$ I have several questions about this problem. I have already had a decision procedure for this problem, but I call it multi-target subset sum problem. It is my research topic. I wonder that where did you encounter this problem or any application about this. Maybe we can discuss it here or in email. Thank you! My email: [email protected] $\endgroup$
    – user25450
    Commented Aug 21, 2012 at 5:42

1 Answer 1

Reset to default
4
$\begingroup$

http://dx.doi.org/10.1016/S0020-0190(00)00010-7

Improve this answer
$\endgroup$
1

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .