How to obtain all possible combinations from n (large) arrays that sum up to a number

Hi,

I am trying to find a code that would efficiently find all combinations from n (large) arrays that would sum up to a particular value. for example:

a=[1:100];
b=[1:100];
c=[1:150];
d=[1:100];
e=[1:100];

all combinations from the above 5 arrays that would sum up to 400 and obtain results in the following format:

[100 100 100 100 0
0  100 100 100 100
100 0 100 100 100]

Thanks,

Maz

Answer 1

[Stephen23]

It seems that you want the Cartesian product of those vectors, but with some extra criteria. There is probably no off-the-shelf solution, but for a start you should take look at these FEX submssions:

http://www.mathworks.com/matlabcentral/fileexchange/5475-cartprod--cartesian-product-of-multiple-sets

http://www.mathworks.com/matlabcentral/fileexchange/10064-allcomb

http://www.mathworks.com/matlabcentral/fileexchange/17818-all-permutations-of-integers-with-sum-criteria

http://www.mathworks.com/matlabcentral/fileexchange/24757-nextvector-toolbox

[Mazsyed]

All of the above tend to run out of memory. I have tried allcomb and cartprod. Any help is highly appreciated.