Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

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

  1. May 4, 2012 #1
    Algorithm for finding best (or combinations of) "non-overlapping" matrix elements.

    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.
     
  2. jcsd
  3. May 4, 2012 #2

    Stephen Tashi

    User Avatar
    Science Advisor

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

    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)
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Algorithm for finding best (or combinations of) non-overlapping matrix elements.
  1. Matrix elements (Replies: 12)

  2. Matrix elements (Replies: 0)

Loading...