Algorithm for finding best (or combinations of) "non-overlapping" matrix elements.

JeffreyP

I'm looking for the best general way to find the "best" combination for a list of non-overlapping 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.

Stephen Tashi

Quote by JeffreyP

The combination of values that results in the highest sum, but where no letter appears more than once.

Sum of what? Are you talking about a situation where the matrix really has 3 items per entry, these being a number and two letters? - such a (93.6,A,E)

Similar Threads for: Algorithm for finding best (or combinations of) "non-overlapping" matrix elements.
Thread	Forum	Replies
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

JeffreyP	Algorithm for finding best (or combinations of) "non-overlapping" matrix elements. Tweet I'm looking for the best general way to find the "best" combination for a list of non-overlapping 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.