Register to reply

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

by JeffreyP
Tags: combinations, matrix algebra
Share this thread:
JeffreyP
#1
May4-12, 11:32 AM
P: 1
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.
Phys.Org News Partner Science news on Phys.org
Hoverbike drone project for air transport takes off
Earlier Stone Age artifacts found in Northern Cape of South Africa
Study reveals new characteristics of complex oxide surfaces
Stephen Tashi
#2
May4-12, 10:33 PM
Sci Advisor
P: 3,247
Quote Quote by JeffreyP View Post

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)


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