Algorithm for finding best (or combinations of) "nonoverlapping" matrix elements.by JeffreyP Tags: combinations, matrix algebra 

#1
May412, 11:32 AM

P: 1

I'm looking for the best general way to find the "best" combination for a list of nonoverlapping matrix elements. For example, given the matrix
AE BE CE DE AF BF CF DF AG BG CG DG AH BH CH DH The combination of values that results in the highest sum, but where no letter appears more than once. 



#2
May412, 10:33 PM

Sci Advisor
P: 3,175




Register to reply 
Related Discussions  
In binary can we have a value with "deci" "centi" "mili" or more lower valued prefix?  Computers  14  
"Weirdness" of polynomial long division algorithm  Precalculus Mathematics Homework  2  
Shankar 12.4.4  "the" rotation matrix vs. "a" rotation matrix (tensor operators QM)  Advanced Physics Homework  2  
Finding "a" and "b" in an infinite series limit comparison test  Calculus & Beyond Homework  10  
Physical, Design, Intentional: An elaboration on "algorithm".  General Discussion  0 