Find the combination that minimizes a cost function
问题 I am facing a problem and I would be grateful to anyone that could help. The problem is the following: Consider that we have a vector D = [D1;D2;D3;...;DN] and a set of time instances TI = {t1,t2,t3,...,tM} . Each element of vector D , Di , corresponds to a subset of TI . For example D1 could correspond to time instances {t1,t2,t3} and D2 to {t2,t4,t5} . I would like to find the combination of elements of D that corresponds to all elements of TI , without any of these being taken into account